./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.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-pr-ci_file-1.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 bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:23:35,563 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:23:35,626 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:23:35,631 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:23:35,632 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:23:35,661 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:23:35,661 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:23:35,662 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:23:35,662 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:23:35,662 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:23:35,663 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:23:35,663 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:23:35,664 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:23:35,665 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:23:35,665 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:23:35,665 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:23:35,666 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:23:35,666 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:23:35,666 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:23:35,667 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:23:35,667 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:23:35,667 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:23:35,668 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:23:35,668 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:23:35,668 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:23:35,669 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:23:35,669 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:23:35,669 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:23:35,670 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:23:35,670 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:23:35,670 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:23:35,670 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:23:35,671 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:35,671 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:23:35,671 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:23:35,672 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:23:35,672 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:23:35,672 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:23:35,672 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:23:35,673 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:23:35,673 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:23:35,675 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:23:35,675 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 -> bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 [2024-11-10 05:23:35,960 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:23:35,982 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:23:35,985 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:23:35,986 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:23:35,987 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:23:35,988 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-pr-ci_file-1.i [2024-11-10 05:23:37,400 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:23:37,598 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:23:37,599 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-11-10 05:23:37,608 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f7da7ed/14417b3914e9415e98795a7f31bcbf73/FLAGc7311b16c [2024-11-10 05:23:37,624 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d8f7da7ed/14417b3914e9415e98795a7f31bcbf73 [2024-11-10 05:23:37,629 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:23:37,630 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:23:37,633 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:37,633 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:23:37,639 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:23:37,640 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:37" (1/1) ... [2024-11-10 05:23:37,641 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e5b536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:37, skipping insertion in model container [2024-11-10 05:23:37,641 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:37" (1/1) ... [2024-11-10 05:23:37,675 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:23:37,894 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-pr-ci_file-1.i[918,931] [2024-11-10 05:23:37,981 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:37,994 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:23:38,007 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-pr-ci_file-1.i[918,931] [2024-11-10 05:23:38,039 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:38,057 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:23:38,058 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38 WrapperNode [2024-11-10 05:23:38,058 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:38,059 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:38,059 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:23:38,059 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:23:38,066 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,083 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,125 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 218 [2024-11-10 05:23:38,126 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:38,127 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:23:38,127 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:23:38,127 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:23:38,138 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,139 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,144 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,161 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 05:23:38,161 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,161 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,171 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,172 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,173 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,175 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,182 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:23:38,183 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:23:38,183 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:23:38,183 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:23:38,184 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (1/1) ... [2024-11-10 05:23:38,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:38,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:38,215 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 05:23:38,222 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 05:23:38,253 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:23:38,253 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:23:38,253 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:23:38,253 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:23:38,253 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:23:38,253 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:23:38,339 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:23:38,343 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:23:38,771 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 05:23:38,772 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:23:38,793 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:23:38,793 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:23:38,794 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:38 BoogieIcfgContainer [2024-11-10 05:23:38,794 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:23:38,796 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:23:38,797 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:23:38,800 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:23:38,800 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:23:37" (1/3) ... [2024-11-10 05:23:38,801 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286faf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:38, skipping insertion in model container [2024-11-10 05:23:38,801 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:38" (2/3) ... [2024-11-10 05:23:38,802 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@286faf14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:38, skipping insertion in model container [2024-11-10 05:23:38,803 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:38" (3/3) ... [2024-11-10 05:23:38,804 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-11-10 05:23:38,819 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:23:38,820 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:23:38,877 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:23:38,883 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;@7fdb4ba4, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:23:38,883 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:23:38,886 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 05:23:38,899 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:23:38,899 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:38,899 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:38,900 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:38,904 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:38,904 INFO L85 PathProgramCache]: Analyzing trace with hash -722869256, now seen corresponding path program 1 times [2024-11-10 05:23:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:38,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821824580] [2024-11-10 05:23:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:38,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:39,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:39,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:39,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:39,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,271 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:39,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,277 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:39,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,295 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:39,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,299 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,308 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:39,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,315 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:39,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,322 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:39,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:39,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:39,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:39,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:39,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:39,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:39,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,365 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:39,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:39,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:39,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:39,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:39,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:39,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:39,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:39,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:39,406 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:39,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:39,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821824580] [2024-11-10 05:23:39,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821824580] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:39,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:39,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:23:39,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762741273] [2024-11-10 05:23:39,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:39,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:23:39,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:39,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:23:39,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:23:39,441 INFO L87 Difference]: Start difference. First operand has 100 states, 66 states have (on average 1.4393939393939394) internal successors, (95), 67 states have internal predecessors, (95), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 05:23:39,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:39,485 INFO L93 Difference]: Finished difference Result 192 states and 338 transitions. [2024-11-10 05:23:39,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:23:39,489 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) Word has length 202 [2024-11-10 05:23:39,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:39,497 INFO L225 Difference]: With dead ends: 192 [2024-11-10 05:23:39,497 INFO L226 Difference]: Without dead ends: 95 [2024-11-10 05:23:39,502 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 95 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 05:23:39,504 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 2 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:39,505 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 146 Invalid, 2 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 2 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2024-11-10 05:23:39,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2024-11-10 05:23:39,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 05:23:39,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 148 transitions. [2024-11-10 05:23:39,560 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 148 transitions. Word has length 202 [2024-11-10 05:23:39,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:39,562 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 148 transitions. [2024-11-10 05:23:39,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 25.0) internal successors, (50), 2 states have internal predecessors, (50), 2 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 05:23:39,563 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 148 transitions. [2024-11-10 05:23:39,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:23:39,569 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:39,570 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:39,570 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:23:39,570 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:39,571 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:39,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1827347448, now seen corresponding path program 1 times [2024-11-10 05:23:39,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:39,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639104767] [2024-11-10 05:23:39,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:39,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:39,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:40,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:40,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:40,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:40,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:40,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:40,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:40,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:40,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:40,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:40,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:40,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:40,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:40,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:40,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:40,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:40,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:40,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:40,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:40,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:40,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:40,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:40,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:40,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:40,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:40,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:40,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:40,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:40,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:40,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:40,187 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:40,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639104767] [2024-11-10 05:23:40,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639104767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:40,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:40,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:23:40,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441131490] [2024-11-10 05:23:40,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:40,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:23:40,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:40,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:23:40,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:23:40,194 INFO L87 Difference]: Start difference. First operand 95 states and 148 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:40,532 INFO L93 Difference]: Finished difference Result 276 states and 433 transitions. [2024-11-10 05:23:40,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:23:40,533 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:23:40,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:40,540 INFO L225 Difference]: With dead ends: 276 [2024-11-10 05:23:40,540 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 05:23:40,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 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 05:23:40,543 INFO L432 NwaCegarLoop]: 141 mSDtfsCounter, 136 mSDsluCounter, 179 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:40,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 320 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:23:40,546 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 05:23:40,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 116. [2024-11-10 05:23:40,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 83 states have (on average 1.4698795180722892) internal successors, (122), 83 states have internal predecessors, (122), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 05:23:40,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 184 transitions. [2024-11-10 05:23:40,566 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 184 transitions. Word has length 202 [2024-11-10 05:23:40,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:40,568 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 184 transitions. [2024-11-10 05:23:40,568 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:40,569 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 184 transitions. [2024-11-10 05:23:40,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:23:40,577 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:40,577 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:40,577 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:23:40,578 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:40,578 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:40,578 INFO L85 PathProgramCache]: Analyzing trace with hash -1580116167, now seen corresponding path program 1 times [2024-11-10 05:23:40,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:40,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1170171628] [2024-11-10 05:23:40,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:40,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:40,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:40,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:40,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,775 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:40,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:40,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:40,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,792 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:40,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,794 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:40,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:40,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,798 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:40,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,800 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:40,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:40,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,805 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:40,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:40,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,812 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:40,813 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:40,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,820 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:40,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,824 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:40,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:40,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,836 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:40,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:40,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:40,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:40,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:40,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,849 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:40,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:40,852 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:40,852 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:40,853 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1170171628] [2024-11-10 05:23:40,853 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1170171628] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:40,853 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:40,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:23:40,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220709393] [2024-11-10 05:23:40,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:40,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:40,855 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:40,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:40,856 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:40,857 INFO L87 Difference]: Start difference. First operand 116 states and 184 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:40,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:40,951 INFO L93 Difference]: Finished difference Result 297 states and 467 transitions. [2024-11-10 05:23:40,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:40,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:23:40,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:40,955 INFO L225 Difference]: With dead ends: 297 [2024-11-10 05:23:40,955 INFO L226 Difference]: Without dead ends: 184 [2024-11-10 05:23:40,956 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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 05:23:40,957 INFO L432 NwaCegarLoop]: 221 mSDtfsCounter, 122 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 339 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:40,957 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 339 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:23:40,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2024-11-10 05:23:40,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2024-11-10 05:23:40,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 115 states have (on average 1.3565217391304347) internal successors, (156), 115 states have internal predecessors, (156), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 05:23:40,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 280 transitions. [2024-11-10 05:23:40,984 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 280 transitions. Word has length 202 [2024-11-10 05:23:40,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:40,985 INFO L471 AbstractCegarLoop]: Abstraction has 180 states and 280 transitions. [2024-11-10 05:23:40,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:40,985 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 280 transitions. [2024-11-10 05:23:40,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:23:40,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:40,988 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:40,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:23:40,988 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:40,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:40,989 INFO L85 PathProgramCache]: Analyzing trace with hash 1321788823, now seen corresponding path program 1 times [2024-11-10 05:23:40,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:40,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432486558] [2024-11-10 05:23:40,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:40,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:41,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,165 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:41,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:41,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,174 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:41,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:41,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:41,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:41,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:41,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:41,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:41,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:41,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:41,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:41,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:41,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:41,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:41,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:41,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:41,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,217 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:41,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:41,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:41,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:41,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:41,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:41,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:41,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:41,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:41,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:41,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:41,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:41,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,251 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:41,251 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:41,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432486558] [2024-11-10 05:23:41,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432486558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:41,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:41,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:23:41,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600058099] [2024-11-10 05:23:41,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:41,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:41,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:41,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:41,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:41,254 INFO L87 Difference]: Start difference. First operand 180 states and 280 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:41,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:41,317 INFO L93 Difference]: Finished difference Result 358 states and 559 transitions. [2024-11-10 05:23:41,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:41,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:23:41,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:41,322 INFO L225 Difference]: With dead ends: 358 [2024-11-10 05:23:41,322 INFO L226 Difference]: Without dead ends: 181 [2024-11-10 05:23:41,327 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 05:23:41,328 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 0 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:41,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 260 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:41,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2024-11-10 05:23:41,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2024-11-10 05:23:41,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 116 states have (on average 1.353448275862069) internal successors, (157), 116 states have internal predecessors, (157), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 05:23:41,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 281 transitions. [2024-11-10 05:23:41,369 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 281 transitions. Word has length 202 [2024-11-10 05:23:41,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:41,370 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 281 transitions. [2024-11-10 05:23:41,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:41,371 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 281 transitions. [2024-11-10 05:23:41,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:23:41,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:41,374 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:41,374 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:23:41,374 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:41,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:41,375 INFO L85 PathProgramCache]: Analyzing trace with hash -2085674792, now seen corresponding path program 1 times [2024-11-10 05:23:41,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:41,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685361679] [2024-11-10 05:23:41,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:41,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:41,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:41,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,704 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:41,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,707 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:41,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:41,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:41,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:41,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,723 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:41,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,729 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:41,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,736 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:41,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:41,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:41,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,752 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:41,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:41,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,761 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:41,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:41,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:41,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:41,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:41,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,785 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:41,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:41,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,797 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:41,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:41,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,813 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:41,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:41,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:41,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:41,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,832 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:41,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:41,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:41,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:41,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,852 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:41,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:41,858 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:41,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:41,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685361679] [2024-11-10 05:23:41,859 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685361679] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:41,860 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:41,860 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:23:41,860 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848590498] [2024-11-10 05:23:41,860 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:41,860 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:41,861 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:41,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:41,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:41,861 INFO L87 Difference]: Start difference. First operand 181 states and 281 transitions. Second operand has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:41,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:41,915 INFO L93 Difference]: Finished difference Result 537 states and 837 transitions. [2024-11-10 05:23:41,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:41,918 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:23:41,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:41,924 INFO L225 Difference]: With dead ends: 537 [2024-11-10 05:23:41,924 INFO L226 Difference]: Without dead ends: 359 [2024-11-10 05:23:41,925 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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 05:23:41,926 INFO L432 NwaCegarLoop]: 158 mSDtfsCounter, 76 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:41,930 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 295 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:41,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 359 states. [2024-11-10 05:23:41,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 359 to 356. [2024-11-10 05:23:41,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 227 states have (on average 1.3524229074889869) internal successors, (307), 227 states have internal predecessors, (307), 124 states have call successors, (124), 4 states have call predecessors, (124), 4 states have return successors, (124), 124 states have call predecessors, (124), 124 states have call successors, (124) [2024-11-10 05:23:41,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 555 transitions. [2024-11-10 05:23:41,983 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 555 transitions. Word has length 202 [2024-11-10 05:23:41,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:41,985 INFO L471 AbstractCegarLoop]: Abstraction has 356 states and 555 transitions. [2024-11-10 05:23:41,986 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.666666666666668) internal successors, (50), 3 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:41,986 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 555 transitions. [2024-11-10 05:23:41,988 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 05:23:41,988 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:41,988 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:41,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:23:41,988 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:41,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:41,989 INFO L85 PathProgramCache]: Analyzing trace with hash -762431244, now seen corresponding path program 1 times [2024-11-10 05:23:41,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:41,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113283435] [2024-11-10 05:23:41,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:41,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:42,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:42,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:42,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:42,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:42,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:42,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:42,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:42,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:42,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:42,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:42,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:42,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:42,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:42,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:42,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:42,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:42,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:42,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:42,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:42,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:42,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:42,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:42,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:42,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:42,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:42,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:42,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,129 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:42,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:42,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113283435] [2024-11-10 05:23:42,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113283435] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:42,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:42,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:23:42,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1708101091] [2024-11-10 05:23:42,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:42,131 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:42,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:42,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:42,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:42,132 INFO L87 Difference]: Start difference. First operand 356 states and 555 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:42,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:42,215 INFO L93 Difference]: Finished difference Result 850 states and 1299 transitions. [2024-11-10 05:23:42,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:42,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-10 05:23:42,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:42,219 INFO L225 Difference]: With dead ends: 850 [2024-11-10 05:23:42,219 INFO L226 Difference]: Without dead ends: 497 [2024-11-10 05:23:42,221 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 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 05:23:42,221 INFO L432 NwaCegarLoop]: 157 mSDtfsCounter, 41 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 295 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:42,222 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 295 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:42,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 497 states. [2024-11-10 05:23:42,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 497 to 490. [2024-11-10 05:23:42,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 490 states, 349 states have (on average 1.3553008595988538) internal successors, (473), 353 states have internal predecessors, (473), 132 states have call successors, (132), 8 states have call predecessors, (132), 8 states have return successors, (132), 128 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-10 05:23:42,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 490 states and 737 transitions. [2024-11-10 05:23:42,277 INFO L78 Accepts]: Start accepts. Automaton has 490 states and 737 transitions. Word has length 203 [2024-11-10 05:23:42,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:42,278 INFO L471 AbstractCegarLoop]: Abstraction has 490 states and 737 transitions. [2024-11-10 05:23:42,278 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:42,278 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 737 transitions. [2024-11-10 05:23:42,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 05:23:42,281 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:42,281 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:42,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 05:23:42,282 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:42,282 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:42,282 INFO L85 PathProgramCache]: Analyzing trace with hash -447338124, now seen corresponding path program 1 times [2024-11-10 05:23:42,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:42,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508042434] [2024-11-10 05:23:42,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:42,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:42,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:42,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:42,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:42,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:42,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:42,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:42,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:42,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:42,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:42,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:42,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:42,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:42,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:42,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:42,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:42,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:42,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:42,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:42,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:42,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:42,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:42,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:42,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:42,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:42,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:42,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:42,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:42,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:42,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:42,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:42,703 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:42,704 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:42,704 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508042434] [2024-11-10 05:23:42,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508042434] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:42,704 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:42,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:23:42,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500592793] [2024-11-10 05:23:42,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:42,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:42,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:42,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:42,707 INFO L87 Difference]: Start difference. First operand 490 states and 737 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:42,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:42,835 INFO L93 Difference]: Finished difference Result 1172 states and 1733 transitions. [2024-11-10 05:23:42,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:42,837 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-10 05:23:42,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:42,843 INFO L225 Difference]: With dead ends: 1172 [2024-11-10 05:23:42,843 INFO L226 Difference]: Without dead ends: 685 [2024-11-10 05:23:42,844 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 68 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 05:23:42,845 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 49 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:42,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 247 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:23:42,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 685 states. [2024-11-10 05:23:42,914 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 685 to 678. [2024-11-10 05:23:42,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 678 states, 469 states have (on average 1.2814498933901919) internal successors, (601), 481 states have internal predecessors, (601), 192 states have call successors, (192), 16 states have call predecessors, (192), 16 states have return successors, (192), 180 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:23:42,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 678 states and 985 transitions. [2024-11-10 05:23:42,921 INFO L78 Accepts]: Start accepts. Automaton has 678 states and 985 transitions. Word has length 203 [2024-11-10 05:23:42,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:42,921 INFO L471 AbstractCegarLoop]: Abstraction has 678 states and 985 transitions. [2024-11-10 05:23:42,921 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:42,922 INFO L276 IsEmpty]: Start isEmpty. Operand 678 states and 985 transitions. [2024-11-10 05:23:42,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 05:23:42,924 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:42,924 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:42,924 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:23:42,924 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:42,925 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:42,925 INFO L85 PathProgramCache]: Analyzing trace with hash -418708973, now seen corresponding path program 1 times [2024-11-10 05:23:42,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:42,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806048637] [2024-11-10 05:23:42,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:42,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:42,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:43,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:43,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,106 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:43,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:43,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:43,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:43,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:43,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:43,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:43,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:43,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:43,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:43,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:43,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:43,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,129 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:43,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:43,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:43,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:43,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:43,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:43,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:43,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:43,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,146 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:43,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:43,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,153 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:43,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:43,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806048637] [2024-11-10 05:23:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806048637] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:43,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:23:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1370856084] [2024-11-10 05:23:43,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:43,154 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:43,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:43,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:43,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:43,156 INFO L87 Difference]: Start difference. First operand 678 states and 985 transitions. Second operand has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:43,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:43,286 INFO L93 Difference]: Finished difference Result 1747 states and 2544 transitions. [2024-11-10 05:23:43,287 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:43,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 203 [2024-11-10 05:23:43,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:43,294 INFO L225 Difference]: With dead ends: 1747 [2024-11-10 05:23:43,294 INFO L226 Difference]: Without dead ends: 1072 [2024-11-10 05:23:43,297 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 65 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 05:23:43,297 INFO L432 NwaCegarLoop]: 146 mSDtfsCounter, 81 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:43,298 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 273 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:43,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1072 states. [2024-11-10 05:23:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1072 to 858. [2024-11-10 05:23:43,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 858 states, 649 states have (on average 1.3513097072419107) internal successors, (877), 661 states have internal predecessors, (877), 192 states have call successors, (192), 16 states have call predecessors, (192), 16 states have return successors, (192), 180 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:23:43,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 858 states to 858 states and 1261 transitions. [2024-11-10 05:23:43,388 INFO L78 Accepts]: Start accepts. Automaton has 858 states and 1261 transitions. Word has length 203 [2024-11-10 05:23:43,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:43,389 INFO L471 AbstractCegarLoop]: Abstraction has 858 states and 1261 transitions. [2024-11-10 05:23:43,389 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 17.0) internal successors, (51), 3 states have internal predecessors, (51), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:43,389 INFO L276 IsEmpty]: Start isEmpty. Operand 858 states and 1261 transitions. [2024-11-10 05:23:43,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-10 05:23:43,392 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:43,392 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:43,392 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 05:23:43,392 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:43,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:43,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1799048980, now seen corresponding path program 1 times [2024-11-10 05:23:43,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:43,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074851176] [2024-11-10 05:23:43,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:43,393 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:43,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:43,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:43,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:43,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,694 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:43,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:43,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:43,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:43,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,702 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:43,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:43,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:43,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:43,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:43,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:43,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:43,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:43,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:43,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:43,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:43,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,774 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:43,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:43,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,779 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:43,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,781 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:43,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,784 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:43,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,787 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:43,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,789 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:43,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,796 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:43,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:43,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,801 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:43,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,804 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:43,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,806 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:43,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:43,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,813 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 05:23:43,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:43,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074851176] [2024-11-10 05:23:43,813 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1074851176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:23:43,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [833300485] [2024-11-10 05:23:43,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:43,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:43,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:43,816 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 05:23:43,818 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 05:23:43,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:43,972 INFO L255 TraceCheckSpWp]: Trace formula consists of 460 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-10 05:23:43,987 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:44,253 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 688 proven. 69 refuted. 0 times theorem prover too weak. 1103 trivial. 0 not checked. [2024-11-10 05:23:44,253 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:23:44,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 05:23:44,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [833300485] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:23:44,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:23:44,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 9 [2024-11-10 05:23:44,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727392808] [2024-11-10 05:23:44,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:23:44,485 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 05:23:44,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:44,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 05:23:44,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:23:44,487 INFO L87 Difference]: Start difference. First operand 858 states and 1261 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-10 05:23:44,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:44,826 INFO L93 Difference]: Finished difference Result 1761 states and 2559 transitions. [2024-11-10 05:23:44,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-10 05:23:44,827 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) Word has length 203 [2024-11-10 05:23:44,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:44,833 INFO L225 Difference]: With dead ends: 1761 [2024-11-10 05:23:44,833 INFO L226 Difference]: Without dead ends: 906 [2024-11-10 05:23:44,836 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 474 GetRequests, 463 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:23:44,837 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 71 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 409 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:44,837 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 409 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 05:23:44,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 906 states. [2024-11-10 05:23:44,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 906 to 890. [2024-11-10 05:23:44,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 890 states, 673 states have (on average 1.326894502228826) internal successors, (893), 685 states have internal predecessors, (893), 192 states have call successors, (192), 24 states have call predecessors, (192), 24 states have return successors, (192), 180 states have call predecessors, (192), 192 states have call successors, (192) [2024-11-10 05:23:44,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 890 states to 890 states and 1277 transitions. [2024-11-10 05:23:44,960 INFO L78 Accepts]: Start accepts. Automaton has 890 states and 1277 transitions. Word has length 203 [2024-11-10 05:23:44,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:44,961 INFO L471 AbstractCegarLoop]: Abstraction has 890 states and 1277 transitions. [2024-11-10 05:23:44,961 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 9 states have internal predecessors, (62), 2 states have call successors, (54), 2 states have call predecessors, (54), 4 states have return successors, (55), 2 states have call predecessors, (55), 2 states have call successors, (55) [2024-11-10 05:23:44,961 INFO L276 IsEmpty]: Start isEmpty. Operand 890 states and 1277 transitions. [2024-11-10 05:23:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 05:23:44,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:44,964 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:44,984 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 05:23:45,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:45,165 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:45,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:45,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1355487042, now seen corresponding path program 1 times [2024-11-10 05:23:45,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:45,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663081592] [2024-11-10 05:23:45,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:45,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:45,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:23:45,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,473 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2024-11-10 05:23:45,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2024-11-10 05:23:45,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,476 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-10 05:23:45,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,478 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-10 05:23:45,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 35 [2024-11-10 05:23:45,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,481 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-10 05:23:45,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,483 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-10 05:23:45,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 51 [2024-11-10 05:23:45,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,485 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 57 [2024-11-10 05:23:45,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 62 [2024-11-10 05:23:45,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2024-11-10 05:23:45,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,490 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 73 [2024-11-10 05:23:45,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 79 [2024-11-10 05:23:45,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 84 [2024-11-10 05:23:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,494 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2024-11-10 05:23:45,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,496 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2024-11-10 05:23:45,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,498 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 101 [2024-11-10 05:23:45,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,500 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-10 05:23:45,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 112 [2024-11-10 05:23:45,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,502 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 117 [2024-11-10 05:23:45,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 123 [2024-11-10 05:23:45,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,506 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 128 [2024-11-10 05:23:45,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 134 [2024-11-10 05:23:45,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 139 [2024-11-10 05:23:45,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 145 [2024-11-10 05:23:45,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,514 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 150 [2024-11-10 05:23:45,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,515 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 156 [2024-11-10 05:23:45,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,517 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 161 [2024-11-10 05:23:45,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 167 [2024-11-10 05:23:45,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,520 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 172 [2024-11-10 05:23:45,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:45,522 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:45,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:23:45,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663081592] [2024-11-10 05:23:45,523 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663081592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:45,523 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:45,523 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 05:23:45,523 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222559843] [2024-11-10 05:23:45,523 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:45,524 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:23:45,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:23:45,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:23:45,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:23:45,525 INFO L87 Difference]: Start difference. First operand 890 states and 1277 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:46,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:46,164 INFO L93 Difference]: Finished difference Result 2193 states and 3128 transitions. [2024-11-10 05:23:46,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:23:46,165 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 204 [2024-11-10 05:23:46,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:46,174 INFO L225 Difference]: With dead ends: 2193 [2024-11-10 05:23:46,174 INFO L226 Difference]: Without dead ends: 1306 [2024-11-10 05:23:46,177 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:23:46,178 INFO L432 NwaCegarLoop]: 219 mSDtfsCounter, 257 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 257 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:46,178 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [257 Valid, 574 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 05:23:46,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1306 states. [2024-11-10 05:23:46,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1306 to 602. [2024-11-10 05:23:46,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 602 states, 453 states have (on average 1.3267108167770418) internal successors, (601), 457 states have internal predecessors, (601), 132 states have call successors, (132), 16 states have call predecessors, (132), 16 states have return successors, (132), 128 states have call predecessors, (132), 132 states have call successors, (132) [2024-11-10 05:23:46,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 602 states to 602 states and 865 transitions. [2024-11-10 05:23:46,291 INFO L78 Accepts]: Start accepts. Automaton has 602 states and 865 transitions. Word has length 204 [2024-11-10 05:23:46,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:46,292 INFO L471 AbstractCegarLoop]: Abstraction has 602 states and 865 transitions. [2024-11-10 05:23:46,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:46,293 INFO L276 IsEmpty]: Start isEmpty. Operand 602 states and 865 transitions. [2024-11-10 05:23:46,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 205 [2024-11-10 05:23:46,295 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:46,295 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:46,295 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-10 05:23:46,295 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:46,296 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:46,296 INFO L85 PathProgramCache]: Analyzing trace with hash 1451994930, now seen corresponding path program 1 times [2024-11-10 05:23:46,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:23:46,296 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437664334] [2024-11-10 05:23:46,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:46,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:23:46,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:23:46,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [820990553] [2024-11-10 05:23:46,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:46,401 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:23:46,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:46,403 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:23:46,405 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 05:23:46,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:23:46,553 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:23:46,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:23:46,817 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:23:46,817 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:23:46,818 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:23:46,839 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:23:47,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-10 05:23:47,028 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:23:47,177 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:23:47,181 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:23:47 BoogieIcfgContainer [2024-11-10 05:23:47,181 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:23:47,182 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:23:47,182 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:23:47,182 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:23:47,183 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:38" (3/4) ... [2024-11-10 05:23:47,185 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:23:47,186 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:23:47,187 INFO L158 Benchmark]: Toolchain (without parser) took 9556.62ms. Allocated memory was 155.2MB in the beginning and 360.7MB in the end (delta: 205.5MB). Free memory was 79.0MB in the beginning and 136.6MB in the end (delta: -57.5MB). Peak memory consumption was 148.3MB. Max. memory is 16.1GB. [2024-11-10 05:23:47,187 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 155.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:23:47,187 INFO L158 Benchmark]: CACSL2BoogieTranslator took 425.62ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 119.6MB in the end (delta: -40.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-10 05:23:47,187 INFO L158 Benchmark]: Boogie Procedure Inliner took 66.84ms. Allocated memory is still 155.2MB. Free memory was 119.6MB in the beginning and 115.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:23:47,188 INFO L158 Benchmark]: Boogie Preprocessor took 55.24ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 111.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-10 05:23:47,188 INFO L158 Benchmark]: IcfgBuilder took 611.71ms. Allocated memory is still 155.2MB. Free memory was 111.2MB in the beginning and 104.4MB in the end (delta: 6.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-10 05:23:47,189 INFO L158 Benchmark]: TraceAbstraction took 8385.09ms. Allocated memory was 155.2MB in the beginning and 360.7MB in the end (delta: 205.5MB). Free memory was 103.9MB in the beginning and 137.6MB in the end (delta: -33.8MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. [2024-11-10 05:23:47,189 INFO L158 Benchmark]: Witness Printer took 3.98ms. Allocated memory is still 360.7MB. Free memory was 137.6MB in the beginning and 136.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:23:47,191 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.20ms. Allocated memory is still 155.2MB. Free memory is still 126.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 425.62ms. Allocated memory is still 155.2MB. Free memory was 78.7MB in the beginning and 119.6MB in the end (delta: -40.9MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 66.84ms. Allocated memory is still 155.2MB. Free memory was 119.6MB in the beginning and 115.4MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.24ms. Allocated memory is still 155.2MB. Free memory was 115.4MB in the beginning and 111.2MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * IcfgBuilder took 611.71ms. Allocated memory is still 155.2MB. Free memory was 111.2MB in the beginning and 104.4MB in the end (delta: 6.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8385.09ms. Allocated memory was 155.2MB in the beginning and 360.7MB in the end (delta: 205.5MB). Free memory was 103.9MB in the beginning and 137.6MB in the end (delta: -33.8MB). Peak memory consumption was 174.9MB. Max. memory is 16.1GB. * Witness Printer took 3.98ms. Allocated memory is still 360.7MB. Free memory was 137.6MB in the beginning and 136.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 188, overapproximation of someBinaryFLOATComparisonOperation at line 188. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] signed short int var_1_1 = 64; [L23] double var_1_6 = 31.5; [L24] double var_1_9 = 1000000000.25; [L25] float var_1_10 = 1.1; [L26] float var_1_11 = 8.75; [L27] float var_1_12 = 63.8; [L28] unsigned char var_1_13 = 1; [L29] float var_1_14 = 127.5; [L30] signed char var_1_15 = -2; [L31] signed char var_1_16 = 1; [L32] signed char var_1_17 = 1; [L33] signed char var_1_18 = 1; [L34] signed char var_1_19 = -2; [L35] signed char var_1_20 = 16; [L36] signed char var_1_21 = 2; [L37] signed char var_1_22 = 8; [L38] unsigned char var_1_23 = 0; [L39] unsigned char var_1_24 = 0; [L40] unsigned char var_1_25 = 0; [L41] unsigned char var_1_26 = 0; [L42] unsigned char var_1_27 = 32; [L43] unsigned char var_1_28 = 1; [L44] unsigned long int var_1_33 = 10; [L45] unsigned long int var_1_35 = 2632045268; [L46] signed long int var_1_36 = 32; [L47] unsigned long int var_1_37 = 128; [L48] unsigned long int var_1_39 = 1877460848; [L49] unsigned long int var_1_40 = 1831388024; [L50] unsigned long int var_1_41 = 1967003719; [L51] unsigned char var_1_42 = 0; [L52] unsigned char var_1_46 = 0; [L53] unsigned short int var_1_49 = 0; VAL [isInitial=0, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2, var_1_9=4000000001/4] [L192] isInitial = 1 [L193] FCALL initially() [L194] COND TRUE 1 [L195] FCALL updateLastVariables() [L196] CALL updateVariables() [L136] var_1_9 = __VERIFIER_nondet_double() [L137] CALL assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L137] RET assume_abort_if_not((var_1_9 >= -922337.2036854765600e+13F && var_1_9 <= -1.0e-20F) || (var_1_9 <= 9223372.036854765600e+12F && var_1_9 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_11=35/4, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L138] var_1_11 = __VERIFIER_nondet_float() [L139] CALL assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L139] RET assume_abort_if_not((var_1_11 >= 0.0F && var_1_11 <= -1.0e-20F) || (var_1_11 <= 9223372.036854765600e+12F && var_1_11 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=1, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L140] var_1_13 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_13 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L141] RET assume_abort_if_not(var_1_13 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] CALL assume_abort_if_not(var_1_13 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L142] RET assume_abort_if_not(var_1_13 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_14=255/2, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L143] var_1_14 = __VERIFIER_nondet_float() [L144] CALL assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L144] RET assume_abort_if_not((var_1_14 >= -922337.2036854765600e+13F && var_1_14 <= -1.0e-20F) || (var_1_14 <= 9223372.036854765600e+12F && var_1_14 >= 1.0e-20F )) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=1, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L145] var_1_16 = __VERIFIER_nondet_char() [L146] CALL assume_abort_if_not(var_1_16 >= -1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L146] RET assume_abort_if_not(var_1_16 >= -1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] CALL assume_abort_if_not(var_1_16 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L147] RET assume_abort_if_not(var_1_16 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=1, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L148] var_1_17 = __VERIFIER_nondet_char() [L149] CALL assume_abort_if_not(var_1_17 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L149] RET assume_abort_if_not(var_1_17 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] CALL assume_abort_if_not(var_1_17 <= 126) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L150] RET assume_abort_if_not(var_1_17 <= 126) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-2, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L151] var_1_19 = __VERIFIER_nondet_char() [L152] CALL assume_abort_if_not(var_1_19 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L152] RET assume_abort_if_not(var_1_19 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] CALL assume_abort_if_not(var_1_19 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L153] RET assume_abort_if_not(var_1_19 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=16, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L154] var_1_20 = __VERIFIER_nondet_char() [L155] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L155] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] CALL assume_abort_if_not(var_1_20 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L156] RET assume_abort_if_not(var_1_20 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=2, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L157] var_1_21 = __VERIFIER_nondet_char() [L158] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L158] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] CALL assume_abort_if_not(var_1_21 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L159] RET assume_abort_if_not(var_1_21 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=8, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L160] var_1_22 = __VERIFIER_nondet_char() [L161] CALL assume_abort_if_not(var_1_22 >= -63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L161] RET assume_abort_if_not(var_1_22 >= -63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] CALL assume_abort_if_not(var_1_22 <= 63) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L162] RET assume_abort_if_not(var_1_22 <= 63) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=0, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L163] var_1_24 = __VERIFIER_nondet_uchar() [L164] CALL assume_abort_if_not(var_1_24 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L164] RET assume_abort_if_not(var_1_24 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] CALL assume_abort_if_not(var_1_24 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L165] RET assume_abort_if_not(var_1_24 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L166] var_1_25 = __VERIFIER_nondet_uchar() [L167] CALL assume_abort_if_not(var_1_25 >= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L167] RET assume_abort_if_not(var_1_25 >= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] CALL assume_abort_if_not(var_1_25 <= 0) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L168] RET assume_abort_if_not(var_1_25 <= 0) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=0, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L169] var_1_26 = __VERIFIER_nondet_uchar() [L170] CALL assume_abort_if_not(var_1_26 >= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L170] RET assume_abort_if_not(var_1_26 >= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] CALL assume_abort_if_not(var_1_26 <= 1) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L171] RET assume_abort_if_not(var_1_26 <= 1) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2632045268, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L172] var_1_35 = __VERIFIER_nondet_ulong() [L173] CALL assume_abort_if_not(var_1_35 >= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L173] RET assume_abort_if_not(var_1_35 >= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] CALL assume_abort_if_not(var_1_35 <= 4294967294) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L174] RET assume_abort_if_not(var_1_35 <= 4294967294) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=1877460848, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L175] var_1_39 = __VERIFIER_nondet_ulong() [L176] CALL assume_abort_if_not(var_1_39 >= 1073741823) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L176] RET assume_abort_if_not(var_1_39 >= 1073741823) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] CALL assume_abort_if_not(var_1_39 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L177] RET assume_abort_if_not(var_1_39 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1831388024, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L178] var_1_40 = __VERIFIER_nondet_ulong() [L179] CALL assume_abort_if_not(var_1_40 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L179] RET assume_abort_if_not(var_1_40 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] CALL assume_abort_if_not(var_1_40 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L180] RET assume_abort_if_not(var_1_40 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1967003719, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L181] var_1_41 = __VERIFIER_nondet_ulong() [L182] CALL assume_abort_if_not(var_1_41 >= 1073741824) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L182] RET assume_abort_if_not(var_1_41 >= 1073741824) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] CALL assume_abort_if_not(var_1_41 <= 2147483647) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L183] RET assume_abort_if_not(var_1_41 <= 2147483647) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=-2, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L196] RET updateVariables() [L197] CALL step() [L57] var_1_15 = (var_1_16 - var_1_17) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L58] COND FALSE !(var_1_21 > (var_1_27 / var_1_35)) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L61] COND FALSE !((var_1_39 - ((((-50) < 0 ) ? -(-50) : (-50)))) < var_1_27) VAL [isInitial=1, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=32, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L66] var_1_27 = var_1_21 [L67] unsigned char stepLocal_1 = var_1_27; [L68] unsigned char stepLocal_0 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_1=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=64, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L69] COND TRUE (var_1_27 + var_1_27) <= stepLocal_1 [L70] var_1_1 = (128 + var_1_27) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L78] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L85] COND FALSE !(var_1_27 < (var_1_27 - var_1_27)) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L88] EXPR var_1_27 >> var_1_27 VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=10, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L88] COND TRUE var_1_17 >= (var_1_27 >> var_1_27) [L89] COND TRUE var_1_25 || (var_1_20 < var_1_17) [L90] var_1_33 = ((((var_1_35 - var_1_17) < 0 ) ? -(var_1_35 - var_1_17) : (var_1_35 - var_1_17))) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=128, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L93] COND TRUE 63.75f <= var_1_11 [L94] var_1_37 = ((var_1_39 + ((((var_1_40) > (var_1_41)) ? (var_1_40) : (var_1_41)))) - ((((var_1_21) < 0 ) ? -(var_1_21) : (var_1_21)))) VAL [isInitial=1, stepLocal_0=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L96] unsigned char stepLocal_2 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_2=0, var_1_10=11/10, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L97] COND FALSE !(var_1_27 > stepLocal_2) [L100] var_1_10 = 9.75f VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=1, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L102] COND TRUE ((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u [L103] var_1_18 = (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))) VAL [isInitial=1, stepLocal_0=0, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L105] signed long int stepLocal_5 = ~ var_1_21; VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L106] COND FALSE !(\read(var_1_13)) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L115] unsigned char stepLocal_4 = var_1_18 >= var_1_27; [L116] unsigned char stepLocal_3 = var_1_27; VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_4=1, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L117] COND FALSE !(var_1_23 && stepLocal_4) VAL [isInitial=1, stepLocal_0=0, stepLocal_3=0, stepLocal_5=-1, var_1_10=39/4, var_1_12=319/5, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L120] COND TRUE 1 >= stepLocal_3 [L121] var_1_12 = var_1_11 VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L126] EXPR var_1_21 | (var_1_21 + var_1_21) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L126] COND FALSE !(var_1_27 < (var_1_21 | (var_1_21 + var_1_21))) [L129] COND FALSE !(var_1_41 < ((((var_1_27) < (var_1_21)) ? (var_1_27) : (var_1_21)))) [L132] var_1_42 = (var_1_25 || var_1_25) VAL [isInitial=1, stepLocal_0=0, stepLocal_5=-1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L197] RET step() [L198] CALL, EXPR property() [L188-L189] return (((((((((var_1_27 + var_1_27) <= var_1_27) ? (var_1_1 == ((signed short int) (128 + var_1_27))) : ((var_1_27 >= (var_1_27 * var_1_27)) ? (var_1_1 == ((signed short int) var_1_27)) : (var_1_1 == ((signed short int) 1)))) && ((var_1_27 < (var_1_27 - var_1_27)) ? (var_1_6 == ((double) var_1_9)) : 1)) && ((var_1_27 > var_1_27) ? (var_1_10 == ((float) (1.00000000000009E13f - var_1_11))) : (var_1_10 == ((float) 9.75f)))) && ((var_1_23 && (var_1_18 >= var_1_27)) ? (var_1_12 == ((float) var_1_11)) : ((1 >= var_1_27) ? (var_1_12 == ((float) var_1_11)) : (var_1_12 == ((float) var_1_14))))) && (var_1_15 == ((signed char) (var_1_16 - var_1_17)))) && ((((((var_1_27) < (var_1_27)) ? (var_1_27) : (var_1_27))) < 25u) ? (var_1_18 == ((signed char) (((((var_1_19) > ((var_1_20 - var_1_21))) ? (var_1_19) : ((var_1_20 - var_1_21)))) + (((((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) < 0 ) ? -((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22))) : ((((var_1_22) < 0 ) ? -(var_1_22) : (var_1_22)))))))) : 1)) && (var_1_13 ? (((~ var_1_21) > var_1_27) ? (var_1_23 == ((unsigned char) (var_1_24 && (! var_1_25)))) : (var_1_24 ? (var_1_23 == ((unsigned char) ((! var_1_25) || var_1_26))) : 1)) : 1)) && (var_1_27 == ((unsigned char) var_1_21)) ; VAL [\result=0, isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L198] RET, EXPR property() [L198] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] [L19] reach_error() VAL [isInitial=1, var_1_10=39/4, var_1_11=2, var_1_12=2, var_1_13=0, var_1_15=0, var_1_16=2, var_1_17=2, var_1_18=2, var_1_19=-63, var_1_1=128, var_1_20=1, var_1_21=0, var_1_22=1, var_1_23=0, var_1_24=1, var_1_25=0, var_1_26=1, var_1_27=0, var_1_28=1, var_1_33=2147483645, var_1_35=2147483647, var_1_36=32, var_1_37=-6442450945, var_1_39=-7516192769, var_1_40=1073741824, var_1_41=1073741824, var_1_42=0, var_1_46=0, var_1_49=0, var_1_6=63/2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.2s, OverallIterations: 11, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 840 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 833 mSDsluCounter, 3158 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1574 mSDsCounter, 77 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 879 IncrementalHoareTripleChecker+Invalid, 956 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 77 mSolverCounterUnsat, 1584 mSDtfsCounter, 879 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1103 GetRequests, 1079 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=890occurred in iteration=9, InterpolantAutomatonStates: 38, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 1023 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.7s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 2637 NumberOfCodeBlocks, 2637 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2420 ConstructedInterpolants, 0 QuantifiedInterpolants, 4226 SizeOfPredicates, 2 NumberOfNonLiveVariables, 460 ConjunctsInSsa, 8 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 22113/22320 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 05:23:47,233 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-pr-ci_file-1.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 bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:23:49,453 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:23:49,538 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:23:49,544 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:23:49,545 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:23:49,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:23:49,577 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:23:49,577 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:23:49,578 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:23:49,579 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:23:49,580 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:23:49,581 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:23:49,581 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:23:49,582 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:23:49,582 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:23:49,585 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:23:49,585 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:23:49,585 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:23:49,586 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:23:49,586 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:23:49,586 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:23:49,587 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:23:49,587 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:23:49,587 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:23:49,587 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:23:49,588 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:23:49,588 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:23:49,588 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:23:49,588 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:23:49,589 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:23:49,589 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:23:49,589 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:23:49,590 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:23:49,590 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:23:49,590 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:49,591 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:23:49,591 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:23:49,591 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:23:49,591 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:23:49,592 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:23:49,592 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:23:49,592 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:23:49,593 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:23:49,593 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:23:49,593 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 -> bcb802c44fca05d9a0a95a2e14fa4747615929a328e29a7c11119462c0cec4c4 [2024-11-10 05:23:49,910 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:23:49,931 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:23:49,935 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:23:49,936 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:23:49,936 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:23:49,938 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-pr-ci_file-1.i [2024-11-10 05:23:51,485 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:23:51,749 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:23:51,750 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-11-10 05:23:51,763 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59dffb3ab/bb9460a55d5a416cacac855119d55cb9/FLAG3c17a0275 [2024-11-10 05:23:52,064 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/59dffb3ab/bb9460a55d5a416cacac855119d55cb9 [2024-11-10 05:23:52,066 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:23:52,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:23:52,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:52,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:23:52,074 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:23:52,075 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,076 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3186f373 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52, skipping insertion in model container [2024-11-10 05:23:52,076 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,105 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:23:52,306 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-pr-ci_file-1.i[918,931] [2024-11-10 05:23:52,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:52,425 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:23:52,441 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-pr-ci_file-1.i[918,931] [2024-11-10 05:23:52,492 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:23:52,518 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:23:52,519 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52 WrapperNode [2024-11-10 05:23:52,519 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:23:52,520 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:52,521 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:23:52,521 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:23:52,527 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,605 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 196 [2024-11-10 05:23:52,605 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:23:52,606 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:23:52,606 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:23:52,606 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:23:52,618 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,619 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,625 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,642 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 05:23:52,646 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,646 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,666 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,668 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,672 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,675 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:23:52,681 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:23:52,681 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:23:52,681 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:23:52,682 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (1/1) ... [2024-11-10 05:23:52,688 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:23:52,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:23:52,716 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 05:23:52,722 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 05:23:52,765 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:23:52,765 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:23:52,765 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:23:52,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:23:52,765 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:23:52,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:23:52,883 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:23:52,885 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:23:53,293 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 05:23:53,293 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:23:53,306 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:23:53,306 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:23:53,307 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:53 BoogieIcfgContainer [2024-11-10 05:23:53,307 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:23:53,309 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:23:53,309 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:23:53,312 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:23:53,312 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:23:52" (1/3) ... [2024-11-10 05:23:53,313 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2848b80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:53, skipping insertion in model container [2024-11-10 05:23:53,313 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:23:52" (2/3) ... [2024-11-10 05:23:53,314 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2848b80f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:23:53, skipping insertion in model container [2024-11-10 05:23:53,314 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:23:53" (3/3) ... [2024-11-10 05:23:53,315 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pr-ci_file-1.i [2024-11-10 05:23:53,340 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:23:53,341 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:23:53,408 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:23:53,416 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;@7020c157, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:23:53,417 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:23:53,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 05:23:53,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:53,438 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:53,439 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:53,439 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:53,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:53,444 INFO L85 PathProgramCache]: Analyzing trace with hash 2107807379, now seen corresponding path program 1 times [2024-11-10 05:23:53,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:23:53,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1274611623] [2024-11-10 05:23:53,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:53,458 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 05:23:53,459 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:23:53,462 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 05:23:53,463 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 05:23:53,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:53,793 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:23:53,805 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:53,871 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 896 proven. 0 refuted. 0 times theorem prover too weak. 964 trivial. 0 not checked. [2024-11-10 05:23:53,872 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:23:53,872 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:23:53,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1274611623] [2024-11-10 05:23:53,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1274611623] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:53,873 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:53,877 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:23:53,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1524864187] [2024-11-10 05:23:53,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:53,888 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:23:53,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:23:53,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:23:53,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:23:53,918 INFO L87 Difference]: Start difference. First operand has 95 states, 61 states have (on average 1.4262295081967213) internal successors, (87), 62 states have internal predecessors, (87), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) Second operand has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 05:23:53,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:53,946 INFO L93 Difference]: Finished difference Result 182 states and 322 transitions. [2024-11-10 05:23:53,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:23:53,948 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) Word has length 200 [2024-11-10 05:23:53,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:53,956 INFO L225 Difference]: With dead ends: 182 [2024-11-10 05:23:53,956 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 05:23:53,960 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 199 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 05:23:53,965 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:53,967 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:53,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 05:23:54,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 05:23:54,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.368421052631579) internal successors, (78), 57 states have internal predecessors, (78), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 05:23:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 140 transitions. [2024-11-10 05:23:54,014 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 140 transitions. Word has length 200 [2024-11-10 05:23:54,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:54,015 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 140 transitions. [2024-11-10 05:23:54,015 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 26.0) internal successors, (52), 2 states have internal predecessors, (52), 2 states have call successors, (31), 2 states have call predecessors, (31), 2 states have return successors, (31), 2 states have call predecessors, (31), 2 states have call successors, (31) [2024-11-10 05:23:54,015 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 140 transitions. [2024-11-10 05:23:54,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:54,021 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:54,021 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:54,031 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 05:23:54,222 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 05:23:54,223 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:54,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:54,224 INFO L85 PathProgramCache]: Analyzing trace with hash 345099923, now seen corresponding path program 1 times [2024-11-10 05:23:54,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:23:54,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [883344688] [2024-11-10 05:23:54,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:54,225 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 05:23:54,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:23:54,229 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 05:23:54,230 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 05:23:54,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:54,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 05:23:54,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:55,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 05:23:55,181 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:23:55,379 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:55,379 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:23:55,379 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [883344688] [2024-11-10 05:23:55,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [883344688] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:23:55,381 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:23:55,381 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [10] total 11 [2024-11-10 05:23:55,381 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788010096] [2024-11-10 05:23:55,381 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:55,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:55,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:23:55,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:55,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:23:55,387 INFO L87 Difference]: Start difference. First operand 90 states and 140 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:55,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:55,530 INFO L93 Difference]: Finished difference Result 177 states and 277 transitions. [2024-11-10 05:23:55,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:55,532 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-11-10 05:23:55,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:55,537 INFO L225 Difference]: With dead ends: 177 [2024-11-10 05:23:55,537 INFO L226 Difference]: Without dead ends: 90 [2024-11-10 05:23:55,538 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 398 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:23:55,541 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:55,541 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 248 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:23:55,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-10 05:23:55,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-10 05:23:55,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 57 states have (on average 1.3508771929824561) internal successors, (77), 57 states have internal predecessors, (77), 31 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 31 states have call predecessors, (31), 31 states have call successors, (31) [2024-11-10 05:23:55,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 139 transitions. [2024-11-10 05:23:55,558 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 139 transitions. Word has length 200 [2024-11-10 05:23:55,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:55,561 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 139 transitions. [2024-11-10 05:23:55,561 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 3 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:55,561 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 139 transitions. [2024-11-10 05:23:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 201 [2024-11-10 05:23:55,565 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:55,565 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:55,575 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:23:55,766 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 05:23:55,766 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:55,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:55,767 INFO L85 PathProgramCache]: Analyzing trace with hash 51696916, now seen corresponding path program 1 times [2024-11-10 05:23:55,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:23:55,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756231552] [2024-11-10 05:23:55,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:55,768 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 05:23:55,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:23:55,770 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 05:23:55,771 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 05:23:56,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:56,029 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:23:56,035 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:56,373 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:23:56,373 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:23:56,374 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756231552] [2024-11-10 05:23:56,374 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756231552] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:56,374 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:56,374 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:23:56,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374434045] [2024-11-10 05:23:56,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:56,375 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:56,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:23:56,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:56,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:56,377 INFO L87 Difference]: Start difference. First operand 90 states and 139 transitions. Second operand has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:56,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:56,424 INFO L93 Difference]: Finished difference Result 264 states and 411 transitions. [2024-11-10 05:23:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:56,425 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 200 [2024-11-10 05:23:56,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:56,428 INFO L225 Difference]: With dead ends: 264 [2024-11-10 05:23:56,428 INFO L226 Difference]: Without dead ends: 177 [2024-11-10 05:23:56,429 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 198 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 05:23:56,430 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 34 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 277 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:56,431 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 277 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:56,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-10 05:23:56,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 174. [2024-11-10 05:23:56,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 109 states have (on average 1.3577981651376148) internal successors, (148), 109 states have internal predecessors, (148), 62 states have call successors, (62), 2 states have call predecessors, (62), 2 states have return successors, (62), 62 states have call predecessors, (62), 62 states have call successors, (62) [2024-11-10 05:23:56,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 272 transitions. [2024-11-10 05:23:56,465 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 272 transitions. Word has length 200 [2024-11-10 05:23:56,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:56,466 INFO L471 AbstractCegarLoop]: Abstraction has 174 states and 272 transitions. [2024-11-10 05:23:56,466 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.0) internal successors, (48), 2 states have internal predecessors, (48), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:56,467 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 272 transitions. [2024-11-10 05:23:56,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 05:23:56,469 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:56,469 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:56,481 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 (4)] Forceful destruction successful, exit code 0 [2024-11-10 05:23:56,673 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 05:23:56,674 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:56,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:56,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1264389204, now seen corresponding path program 1 times [2024-11-10 05:23:56,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:23:56,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [506927518] [2024-11-10 05:23:56,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:56,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:23:56,676 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:23:56,679 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 05:23:56,682 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 05:23:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:56,917 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-10 05:23:56,921 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:56,945 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:23:56,945 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:23:56,946 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:23:56,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [506927518] [2024-11-10 05:23:56,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [506927518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:23:56,948 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:23:56,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:23:56,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527820021] [2024-11-10 05:23:56,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:23:56,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 05:23:56,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:23:56,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 05:23:56,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 05:23:56,953 INFO L87 Difference]: Start difference. First operand 174 states and 272 transitions. Second operand has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:57,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:23:57,009 INFO L93 Difference]: Finished difference Result 406 states and 622 transitions. [2024-11-10 05:23:57,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 05:23:57,009 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 201 [2024-11-10 05:23:57,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:23:57,014 INFO L225 Difference]: With dead ends: 406 [2024-11-10 05:23:57,016 INFO L226 Difference]: Without dead ends: 235 [2024-11-10 05:23:57,017 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 199 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 05:23:57,018 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 33 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:23:57,020 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 280 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:23:57,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-10 05:23:57,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 230. [2024-11-10 05:23:57,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 159 states have (on average 1.3522012578616351) internal successors, (215), 161 states have internal predecessors, (215), 66 states have call successors, (66), 4 states have call predecessors, (66), 4 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:23:57,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 347 transitions. [2024-11-10 05:23:57,070 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 347 transitions. Word has length 201 [2024-11-10 05:23:57,071 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:23:57,071 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 347 transitions. [2024-11-10 05:23:57,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 16.333333333333332) internal successors, (49), 3 states have internal predecessors, (49), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:23:57,072 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 347 transitions. [2024-11-10 05:23:57,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 202 [2024-11-10 05:23:57,076 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:23:57,076 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:23:57,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-10 05:23:57,276 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 05:23:57,277 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:23:57,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:23:57,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1080751148, now seen corresponding path program 1 times [2024-11-10 05:23:57,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:23:57,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483432945] [2024-11-10 05:23:57,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:23:57,279 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 05:23:57,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:23:57,280 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 05:23:57,284 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 05:23:57,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:23:57,533 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 05:23:57,538 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:23:58,264 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1085 proven. 159 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2024-11-10 05:23:58,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:23:58,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 21 proven. 69 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-10 05:23:58,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:23:58,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483432945] [2024-11-10 05:23:58,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483432945] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:23:58,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:23:58,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 18 [2024-11-10 05:23:58,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [428977628] [2024-11-10 05:23:58,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:23:58,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-10 05:23:58,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:23:58,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-10 05:23:58,753 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:23:58,754 INFO L87 Difference]: Start difference. First operand 230 states and 347 transitions. Second operand has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-10 05:24:00,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:24:00,150 INFO L93 Difference]: Finished difference Result 732 states and 1045 transitions. [2024-11-10 05:24:00,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2024-11-10 05:24:00,151 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) Word has length 201 [2024-11-10 05:24:00,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:24:00,157 INFO L225 Difference]: With dead ends: 732 [2024-11-10 05:24:00,157 INFO L226 Difference]: Without dead ends: 505 [2024-11-10 05:24:00,158 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 429 GetRequests, 388 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 421 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=479, Invalid=1243, Unknown=0, NotChecked=0, Total=1722 [2024-11-10 05:24:00,159 INFO L432 NwaCegarLoop]: 87 mSDtfsCounter, 266 mSDsluCounter, 287 mSDsCounter, 0 mSdLazyCounter, 554 mSolverCounterSat, 157 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 711 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 157 IncrementalHoareTripleChecker+Valid, 554 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-10 05:24:00,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 374 Invalid, 711 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [157 Valid, 554 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-10 05:24:00,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 505 states. [2024-11-10 05:24:00,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 505 to 286. [2024-11-10 05:24:00,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 207 states have (on average 1.289855072463768) internal successors, (267), 209 states have internal predecessors, (267), 66 states have call successors, (66), 12 states have call predecessors, (66), 12 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:24:00,202 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 399 transitions. [2024-11-10 05:24:00,203 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 399 transitions. Word has length 201 [2024-11-10 05:24:00,203 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:24:00,204 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 399 transitions. [2024-11-10 05:24:00,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.111111111111111) internal successors, (92), 17 states have internal predecessors, (92), 5 states have call successors, (54), 4 states have call predecessors, (54), 7 states have return successors, (55), 5 states have call predecessors, (55), 5 states have call successors, (55) [2024-11-10 05:24:00,204 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 399 transitions. [2024-11-10 05:24:00,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:24:00,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:00,207 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:24:00,222 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-10 05:24:00,407 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 05:24:00,408 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:00,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:00,409 INFO L85 PathProgramCache]: Analyzing trace with hash 611977848, now seen corresponding path program 1 times [2024-11-10 05:24:00,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:00,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2145906131] [2024-11-10 05:24:00,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:00,410 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 05:24:00,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:00,413 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 05:24:00,414 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 05:24:00,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:00,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 05:24:00,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:24:01,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 05:24:01,362 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:24:01,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:24:01,712 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:24:01,712 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2145906131] [2024-11-10 05:24:01,712 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2145906131] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:24:01,712 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:24:01,712 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2024-11-10 05:24:01,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119926100] [2024-11-10 05:24:01,713 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:24:01,713 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:24:01,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:24:01,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:24:01,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2024-11-10 05:24:01,714 INFO L87 Difference]: Start difference. First operand 286 states and 399 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:02,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:24:02,417 INFO L93 Difference]: Finished difference Result 1172 states and 1623 transitions. [2024-11-10 05:24:02,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 05:24:02,418 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:24:02,418 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:24:02,423 INFO L225 Difference]: With dead ends: 1172 [2024-11-10 05:24:02,423 INFO L226 Difference]: Without dead ends: 889 [2024-11-10 05:24:02,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 407 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2024-11-10 05:24:02,428 INFO L432 NwaCegarLoop]: 112 mSDtfsCounter, 408 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 408 SdHoareTripleChecker+Valid, 512 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 147 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:24:02,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [408 Valid, 512 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [147 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 05:24:02,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 889 states. [2024-11-10 05:24:02,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 889 to 526. [2024-11-10 05:24:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 409 states have (on average 1.332518337408313) internal successors, (545), 415 states have internal predecessors, (545), 96 states have call successors, (96), 20 states have call predecessors, (96), 20 states have return successors, (96), 90 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-10 05:24:02,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 737 transitions. [2024-11-10 05:24:02,494 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 737 transitions. Word has length 202 [2024-11-10 05:24:02,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:24:02,494 INFO L471 AbstractCegarLoop]: Abstraction has 526 states and 737 transitions. [2024-11-10 05:24:02,496 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 737 transitions. [2024-11-10 05:24:02,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:24:02,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:02,500 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:24:02,513 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 (7)] Ended with exit code 0 [2024-11-10 05:24:02,700 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 05:24:02,701 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:02,701 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:02,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1940179113, now seen corresponding path program 1 times [2024-11-10 05:24:02,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:02,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [348376002] [2024-11-10 05:24:02,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:02,702 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 05:24:02,702 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:02,705 INFO L229 MonitoredProcess]: Starting monitored process 8 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 05:24:02,707 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 (8)] Waiting until timeout for monitored process [2024-11-10 05:24:02,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:02,897 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-10 05:24:02,901 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:24:03,606 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1073 proven. 84 refuted. 0 times theorem prover too weak. 703 trivial. 0 not checked. [2024-11-10 05:24:03,607 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:24:04,178 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 207 proven. 54 refuted. 0 times theorem prover too weak. 1599 trivial. 0 not checked. [2024-11-10 05:24:04,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:24:04,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [348376002] [2024-11-10 05:24:04,179 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [348376002] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:24:04,179 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:24:04,179 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12] total 24 [2024-11-10 05:24:04,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534143850] [2024-11-10 05:24:04,179 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:24:04,180 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-10 05:24:04,180 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:24:04,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-10 05:24:04,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=179, Invalid=373, Unknown=0, NotChecked=0, Total=552 [2024-11-10 05:24:04,182 INFO L87 Difference]: Start difference. First operand 526 states and 737 transitions. Second operand has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 22 states have internal predecessors, (102), 5 states have call successors, (48), 4 states have call predecessors, (48), 9 states have return successors, (49), 7 states have call predecessors, (49), 5 states have call successors, (49) [2024-11-10 05:24:05,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:24:05,167 INFO L93 Difference]: Finished difference Result 1115 states and 1543 transitions. [2024-11-10 05:24:05,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-10 05:24:05,168 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 22 states have internal predecessors, (102), 5 states have call successors, (48), 4 states have call predecessors, (48), 9 states have return successors, (49), 7 states have call predecessors, (49), 5 states have call successors, (49) Word has length 202 [2024-11-10 05:24:05,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:24:05,177 INFO L225 Difference]: With dead ends: 1115 [2024-11-10 05:24:05,177 INFO L226 Difference]: Without dead ends: 592 [2024-11-10 05:24:05,179 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 413 GetRequests, 379 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 341 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=415, Invalid=775, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 05:24:05,180 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 229 mSDsluCounter, 272 mSDsCounter, 0 mSdLazyCounter, 614 mSolverCounterSat, 125 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 255 SdHoareTripleChecker+Valid, 379 SdHoareTripleChecker+Invalid, 739 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 125 IncrementalHoareTripleChecker+Valid, 614 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:24:05,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [255 Valid, 379 Invalid, 739 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [125 Valid, 614 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-10 05:24:05,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2024-11-10 05:24:05,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 344. [2024-11-10 05:24:05,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 261 states have (on average 1.2911877394636015) internal successors, (337), 263 states have internal predecessors, (337), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:24:05,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 469 transitions. [2024-11-10 05:24:05,218 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 469 transitions. Word has length 202 [2024-11-10 05:24:05,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:24:05,218 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 469 transitions. [2024-11-10 05:24:05,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 4.434782608695652) internal successors, (102), 22 states have internal predecessors, (102), 5 states have call successors, (48), 4 states have call predecessors, (48), 9 states have return successors, (49), 7 states have call predecessors, (49), 5 states have call successors, (49) [2024-11-10 05:24:05,219 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 469 transitions. [2024-11-10 05:24:05,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:24:05,221 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:05,221 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:24:05,234 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 (8)] Ended with exit code 0 [2024-11-10 05:24:05,422 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 05:24:05,422 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:05,423 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1911549962, now seen corresponding path program 1 times [2024-11-10 05:24:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800082823] [2024-11-10 05:24:05,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:05,423 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 05:24:05,423 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:05,425 INFO L229 MonitoredProcess]: Starting monitored process 9 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 05:24:05,427 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 (9)] Waiting until timeout for monitored process [2024-11-10 05:24:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:05,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 05:24:05,616 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:24:06,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 05:24:06,226 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:24:06,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:24:06,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:24:06,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800082823] [2024-11-10 05:24:06,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800082823] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:24:06,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:24:06,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 13 [2024-11-10 05:24:06,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856716294] [2024-11-10 05:24:06,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:24:06,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 05:24:06,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:24:06,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 05:24:06,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:24:06,472 INFO L87 Difference]: Start difference. First operand 344 states and 469 transitions. Second operand has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:06,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:24:06,900 INFO L93 Difference]: Finished difference Result 1226 states and 1639 transitions. [2024-11-10 05:24:06,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:24:06,901 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:24:06,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:24:06,906 INFO L225 Difference]: With dead ends: 1226 [2024-11-10 05:24:06,906 INFO L226 Difference]: Without dead ends: 885 [2024-11-10 05:24:06,907 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 405 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=43, Invalid=167, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:24:06,908 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 297 mSDsluCounter, 413 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 56 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 527 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 56 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:24:06,908 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [297 Valid, 527 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [56 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:24:06,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-10 05:24:06,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 344. [2024-11-10 05:24:06,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 261 states have (on average 1.2758620689655173) internal successors, (333), 263 states have internal predecessors, (333), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:24:06,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 465 transitions. [2024-11-10 05:24:06,944 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 465 transitions. Word has length 202 [2024-11-10 05:24:06,944 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:24:06,944 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 465 transitions. [2024-11-10 05:24:06,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.0) internal successors, (50), 5 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:06,945 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 465 transitions. [2024-11-10 05:24:06,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:24:06,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:06,948 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:24:06,960 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 (9)] Ended with exit code 0 [2024-11-10 05:24:07,149 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 05:24:07,149 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:07,151 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:07,151 INFO L85 PathProgramCache]: Analyzing trace with hash 2090014327, now seen corresponding path program 1 times [2024-11-10 05:24:07,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:07,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1834994146] [2024-11-10 05:24:07,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:07,152 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 05:24:07,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:07,155 INFO L229 MonitoredProcess]: Starting monitored process 10 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 05:24:07,156 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 (10)] Waiting until timeout for monitored process [2024-11-10 05:24:07,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:07,346 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 05:24:07,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:24:07,730 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 05:24:07,730 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:24:07,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:24:07,879 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:24:07,879 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1834994146] [2024-11-10 05:24:07,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1834994146] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:24:07,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:24:07,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10] total 12 [2024-11-10 05:24:07,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118265027] [2024-11-10 05:24:07,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:24:07,880 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:24:07,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:24:07,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:24:07,881 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:24:07,881 INFO L87 Difference]: Start difference. First operand 344 states and 465 transitions. Second operand has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:08,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:24:08,192 INFO L93 Difference]: Finished difference Result 938 states and 1263 transitions. [2024-11-10 05:24:08,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:24:08,193 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:24:08,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:24:08,196 INFO L225 Difference]: With dead ends: 938 [2024-11-10 05:24:08,196 INFO L226 Difference]: Without dead ends: 563 [2024-11-10 05:24:08,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 402 GetRequests, 392 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:24:08,199 INFO L432 NwaCegarLoop]: 208 mSDtfsCounter, 178 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:24:08,200 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 317 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:24:08,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 563 states. [2024-11-10 05:24:08,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 563 to 344. [2024-11-10 05:24:08,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 344 states, 261 states have (on average 1.2681992337164751) internal successors, (331), 263 states have internal predecessors, (331), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:24:08,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 344 states to 344 states and 463 transitions. [2024-11-10 05:24:08,232 INFO L78 Accepts]: Start accepts. Automaton has 344 states and 463 transitions. Word has length 202 [2024-11-10 05:24:08,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:24:08,233 INFO L471 AbstractCegarLoop]: Abstraction has 344 states and 463 transitions. [2024-11-10 05:24:08,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.5) internal successors, (50), 4 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:08,233 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 463 transitions. [2024-11-10 05:24:08,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:24:08,236 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:08,237 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:24:08,251 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 (10)] Ended with exit code 0 [2024-11-10 05:24:08,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 05:24:08,438 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:08,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:08,438 INFO L85 PathProgramCache]: Analyzing trace with hash 573600246, now seen corresponding path program 1 times [2024-11-10 05:24:08,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:08,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [496342942] [2024-11-10 05:24:08,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:08,439 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 05:24:08,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:08,443 INFO L229 MonitoredProcess]: Starting monitored process 11 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 05:24:08,444 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 (11)] Waiting until timeout for monitored process [2024-11-10 05:24:08,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:08,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 05:24:08,666 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:24:09,133 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 959 proven. 96 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-10 05:24:09,133 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:24:09,360 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1860 trivial. 0 not checked. [2024-11-10 05:24:09,361 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:24:09,361 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [496342942] [2024-11-10 05:24:09,361 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [496342942] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-10 05:24:09,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-10 05:24:09,362 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [11] total 15 [2024-11-10 05:24:09,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422361829] [2024-11-10 05:24:09,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:24:09,362 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:24:09,362 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:24:09,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:24:09,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=158, Unknown=0, NotChecked=0, Total=210 [2024-11-10 05:24:09,364 INFO L87 Difference]: Start difference. First operand 344 states and 463 transitions. Second operand has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:24:09,772 INFO L93 Difference]: Finished difference Result 987 states and 1309 transitions. [2024-11-10 05:24:09,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:24:09,773 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) Word has length 202 [2024-11-10 05:24:09,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:24:09,778 INFO L225 Difference]: With dead ends: 987 [2024-11-10 05:24:09,779 INFO L226 Difference]: Without dead ends: 646 [2024-11-10 05:24:09,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 403 GetRequests, 389 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=60, Invalid=180, Unknown=0, NotChecked=0, Total=240 [2024-11-10 05:24:09,780 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 177 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 60 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 168 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 60 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:24:09,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 300 Invalid, 168 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [60 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:24:09,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 646 states. [2024-11-10 05:24:09,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 646 to 406. [2024-11-10 05:24:09,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 406 states, 323 states have (on average 1.2910216718266254) internal successors, (417), 325 states have internal predecessors, (417), 66 states have call successors, (66), 16 states have call predecessors, (66), 16 states have return successors, (66), 64 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:24:09,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 406 states to 406 states and 549 transitions. [2024-11-10 05:24:09,823 INFO L78 Accepts]: Start accepts. Automaton has 406 states and 549 transitions. Word has length 202 [2024-11-10 05:24:09,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:24:09,826 INFO L471 AbstractCegarLoop]: Abstraction has 406 states and 549 transitions. [2024-11-10 05:24:09,826 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.333333333333334) internal successors, (50), 6 states have internal predecessors, (50), 1 states have call successors, (31), 1 states have call predecessors, (31), 1 states have return successors, (31), 1 states have call predecessors, (31), 1 states have call successors, (31) [2024-11-10 05:24:09,826 INFO L276 IsEmpty]: Start isEmpty. Operand 406 states and 549 transitions. [2024-11-10 05:24:09,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-10 05:24:09,829 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:24:09,829 INFO L215 NwaCegarLoop]: trace histogram [31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 05:24:09,841 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 (11)] Ended with exit code 0 [2024-11-10 05:24:10,029 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 05:24:10,030 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:24:10,030 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:24:10,030 INFO L85 PathProgramCache]: Analyzing trace with hash 1461103927, now seen corresponding path program 1 times [2024-11-10 05:24:10,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:24:10,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108914764] [2024-11-10 05:24:10,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:24:10,031 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 05:24:10,031 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:24:10,032 INFO L229 MonitoredProcess]: Starting monitored process 12 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 05:24:10,033 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 (12)] Waiting until timeout for monitored process [2024-11-10 05:24:10,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:24:10,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-10 05:24:10,223 INFO L278 TraceCheckSpWp]: Computing forward predicates...