./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.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 f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:02:50,888 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:02:50,967 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 17:02:50,973 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:02:50,973 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:02:51,004 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:02:51,004 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:02:51,005 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:02:51,005 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:02:51,006 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:02:51,007 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:02:51,008 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:02:51,008 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:02:51,009 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:02:51,009 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:02:51,010 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:02:51,010 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:02:51,010 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:02:51,010 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 17:02:51,011 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:02:51,011 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:02:51,015 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:02:51,015 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:02:51,015 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:02:51,016 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:02:51,016 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:02:51,016 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:02:51,016 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:02:51,017 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:02:51,017 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:02:51,017 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:02:51,017 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:02:51,017 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:02:51,018 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:02:51,018 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:02:51,018 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:02:51,018 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 17:02:51,018 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 17:02:51,019 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:02:51,019 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:02:51,019 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:02:51,020 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:02:51,020 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 -> f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a [2024-11-16 17:02:51,290 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:02:51,311 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:02:51,313 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:02:51,316 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:02:51,316 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:02:51,317 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i [2024-11-16 17:02:52,664 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:02:52,906 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:02:52,907 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i [2024-11-16 17:02:52,921 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e023deb/d4a555b29f5b446b9926aeb7e9579dbf/FLAGbe1a8da5a [2024-11-16 17:02:52,939 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b6e023deb/d4a555b29f5b446b9926aeb7e9579dbf [2024-11-16 17:02:52,943 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:02:52,945 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:02:52,948 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:02:52,949 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:02:52,955 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:02:52,956 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:02:52" (1/1) ... [2024-11-16 17:02:52,957 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4ac00fbf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:52, skipping insertion in model container [2024-11-16 17:02:52,957 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:02:52" (1/1) ... [2024-11-16 17:02:52,999 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:02:53,197 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_operatoramount_amount100_file-22.i[916,929] [2024-11-16 17:02:53,319 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:02:53,334 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:02:53,349 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_operatoramount_amount100_file-22.i[916,929] [2024-11-16 17:02:53,413 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:02:53,440 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:02:53,443 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53 WrapperNode [2024-11-16 17:02:53,443 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:02:53,446 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:02:53,446 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:02:53,447 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:02:53,454 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,467 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,520 INFO L138 Inliner]: procedures = 26, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 256 [2024-11-16 17:02:53,520 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:02:53,521 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:02:53,521 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:02:53,522 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:02:53,534 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,535 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,572 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:02:53,578 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,579 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,601 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,604 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,612 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,626 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:02:53,628 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:02:53,629 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:02:53,629 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:02:53,630 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (1/1) ... [2024-11-16 17:02:53,635 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:02:53,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:02:53,662 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:02:53,665 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:02:53,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:02:53,716 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:02:53,717 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:02:53,717 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 17:02:53,718 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:02:53,718 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:02:53,824 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:02:53,826 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:02:54,297 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint L204: havoc property_#t~bitwise22#1;havoc property_#t~bitwise23#1;havoc property_#t~short24#1; [2024-11-16 17:02:54,336 INFO L? ?]: Removed 23 outVars from TransFormulas that were not future-live. [2024-11-16 17:02:54,336 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:02:54,366 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:02:54,366 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:02:54,367 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:02:54 BoogieIcfgContainer [2024-11-16 17:02:54,367 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:02:54,370 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:02:54,371 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:02:54,374 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:02:54,375 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:02:52" (1/3) ... [2024-11-16 17:02:54,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a7267d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:02:54, skipping insertion in model container [2024-11-16 17:02:54,376 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:02:53" (2/3) ... [2024-11-16 17:02:54,376 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a7267d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:02:54, skipping insertion in model container [2024-11-16 17:02:54,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:02:54" (3/3) ... [2024-11-16 17:02:54,379 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-22.i [2024-11-16 17:02:54,398 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:02:54,399 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:02:54,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:02:54,538 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;@5cb3f9c2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:02:54,538 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:02:54,547 INFO L276 IsEmpty]: Start isEmpty. Operand has 105 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 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-16 17:02:54,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-16 17:02:54,564 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:54,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, 1, 1] [2024-11-16 17:02:54,565 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:54,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:54,571 INFO L85 PathProgramCache]: Analyzing trace with hash 1720979733, now seen corresponding path program 1 times [2024-11-16 17:02:54,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:02:54,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913660731] [2024-11-16 17:02:54,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:54,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:02:54,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:02:54,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:02:54,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,964 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:02:54,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:02:54,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:02:54,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:02:54,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:02:54,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:54,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:02:54,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:02:55,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:02:55,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:02:55,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:02:55,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:02:55,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:02:55,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:02:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:02:55,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:02:55,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,035 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:02:55,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:02:55,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:02:55,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:02:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:02:55,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,060 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:02:55,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:02:55,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:02:55,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:02:55,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:02:55,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:02:55,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:02:55,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:02:55,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:02:55,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,108 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-16 17:02:55,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:02:55,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913660731] [2024-11-16 17:02:55,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913660731] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:02:55,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:02:55,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 17:02:55,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [779226211] [2024-11-16 17:02:55,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:02:55,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 17:02:55,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:02:55,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 17:02:55,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 17:02:55,147 INFO L87 Difference]: Start difference. First operand has 105 states, 71 states have (on average 1.408450704225352) internal successors, (100), 72 states have internal predecessors, (100), 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-16 17:02:55,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:02:55,192 INFO L93 Difference]: Finished difference Result 202 states and 348 transitions. [2024-11-16 17:02:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 17:02:55,196 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-16 17:02:55,197 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:02:55,207 INFO L225 Difference]: With dead ends: 202 [2024-11-16 17:02:55,208 INFO L226 Difference]: Without dead ends: 100 [2024-11-16 17:02:55,212 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-16 17:02:55,216 INFO L432 NwaCegarLoop]: 150 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 4 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:02:55,217 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 4 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:02:55,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-16 17:02:55,273 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-16 17:02:55,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 67 states have (on average 1.373134328358209) internal successors, (92), 67 states have internal predecessors, (92), 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-16 17:02:55,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 154 transitions. [2024-11-16 17:02:55,283 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 154 transitions. Word has length 202 [2024-11-16 17:02:55,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:02:55,285 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 154 transitions. [2024-11-16 17:02:55,285 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-16 17:02:55,286 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 154 transitions. [2024-11-16 17:02:55,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 203 [2024-11-16 17:02:55,292 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:55,293 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-16 17:02:55,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 17:02:55,294 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:55,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:55,294 INFO L85 PathProgramCache]: Analyzing trace with hash 891765140, now seen corresponding path program 1 times [2024-11-16 17:02:55,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:02:55,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [590427714] [2024-11-16 17:02:55,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:55,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:02:55,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:02:55,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:02:55,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,888 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:02:55,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:02:55,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:02:55,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:02:55,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:02:55,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,929 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:02:55,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,934 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:02:55,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:02:55,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,947 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:02:55,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:02:55,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:02:55,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:02:55,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:02:55,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:02:55,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:55,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:02:56,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:02:56,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:02:56,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:02:56,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:02:56,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:02:56,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:02:56,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:02:56,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:02:56,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:02:56,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:02:56,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:02:56,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:02:56,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:02:56,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:02:56,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,088 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-16 17:02:56,092 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:02:56,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [590427714] [2024-11-16 17:02:56,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [590427714] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:02:56,093 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:02:56,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:02:56,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018701896] [2024-11-16 17:02:56,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:02:56,095 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:02:56,097 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:02:56,098 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:02:56,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:02:56,099 INFO L87 Difference]: Start difference. First operand 100 states and 154 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-16 17:02:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:02:56,451 INFO L93 Difference]: Finished difference Result 329 states and 507 transitions. [2024-11-16 17:02:56,452 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:02:56,452 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-16 17:02:56,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:02:56,457 INFO L225 Difference]: With dead ends: 329 [2024-11-16 17:02:56,458 INFO L226 Difference]: Without dead ends: 232 [2024-11-16 17:02:56,459 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:02:56,461 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 203 mSDsluCounter, 407 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 97 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 97 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:02:56,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [203 Valid, 544 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [97 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:02:56,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 232 states. [2024-11-16 17:02:56,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 232 to 214. [2024-11-16 17:02:56,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 149 states have (on average 1.4026845637583893) internal successors, (209), 149 states have internal predecessors, (209), 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-16 17:02:56,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 333 transitions. [2024-11-16 17:02:56,513 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 333 transitions. Word has length 202 [2024-11-16 17:02:56,514 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:02:56,515 INFO L471 AbstractCegarLoop]: Abstraction has 214 states and 333 transitions. [2024-11-16 17:02:56,515 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-16 17:02:56,516 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 333 transitions. [2024-11-16 17:02:56,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-16 17:02:56,522 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:56,522 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-16 17:02:56,522 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 17:02:56,522 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:56,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:56,523 INFO L85 PathProgramCache]: Analyzing trace with hash -298996290, now seen corresponding path program 1 times [2024-11-16 17:02:56,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:02:56,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189040305] [2024-11-16 17:02:56,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:56,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:02:56,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,856 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:02:56,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:02:56,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:02:56,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:02:56,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,880 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:02:56,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:02:56,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:02:56,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,895 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:02:56,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,899 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:02:56,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,902 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:02:56,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,905 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:02:56,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:02:56,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:02:56,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:02:56,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:02:56,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:02:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,935 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:02:56,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:02:56,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:02:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,950 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:02:56,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,953 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:02:56,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:02:56,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:02:56,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,969 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:02:56,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:02:56,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:02:56,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:02:56,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:02:56,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:02:56,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,994 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:02:56,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:56,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:02:57,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,003 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-16 17:02:57,003 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:02:57,003 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189040305] [2024-11-16 17:02:57,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1189040305] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:02:57,004 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:02:57,004 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:02:57,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327848] [2024-11-16 17:02:57,004 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:02:57,005 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:02:57,005 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:02:57,006 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:02:57,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:02:57,006 INFO L87 Difference]: Start difference. First operand 214 states and 333 transitions. Second operand has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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-16 17:02:57,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:02:57,386 INFO L93 Difference]: Finished difference Result 575 states and 886 transitions. [2024-11-16 17:02:57,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:02:57,387 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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-16 17:02:57,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:02:57,391 INFO L225 Difference]: With dead ends: 575 [2024-11-16 17:02:57,391 INFO L226 Difference]: Without dead ends: 364 [2024-11-16 17:02:57,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:02:57,394 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 181 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 181 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:02:57,395 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [181 Valid, 643 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:02:57,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 364 states. [2024-11-16 17:02:57,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 364 to 308. [2024-11-16 17:02:57,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 308 states, 211 states have (on average 1.3838862559241707) internal successors, (292), 211 states have internal predecessors, (292), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-16 17:02:57,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 478 transitions. [2024-11-16 17:02:57,442 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 478 transitions. Word has length 203 [2024-11-16 17:02:57,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:02:57,443 INFO L471 AbstractCegarLoop]: Abstraction has 308 states and 478 transitions. [2024-11-16 17:02:57,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.5) internal successors, (51), 6 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-16 17:02:57,443 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 478 transitions. [2024-11-16 17:02:57,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2024-11-16 17:02:57,449 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:57,449 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-16 17:02:57,449 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-16 17:02:57,450 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:57,450 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:57,450 INFO L85 PathProgramCache]: Analyzing trace with hash 1957914717, now seen corresponding path program 1 times [2024-11-16 17:02:57,450 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:02:57,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677851227] [2024-11-16 17:02:57,451 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:57,451 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:02:57,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:02:57,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:02:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:02:57,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,893 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:02:57,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:02:57,901 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:02:57,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:02:57,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:02:57,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:02:57,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:02:57,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:02:57,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:02:57,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:02:57,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:02:57,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,958 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:02:57,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,963 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:02:57,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,970 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:02:57,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:02:57,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:02:57,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:02:57,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:57,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:02:57,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:02:58,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:02:58,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,018 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:02:58,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:02:58,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:02:58,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:02:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:02:58,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:02:58,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:02:58,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:02:58,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,081 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-16 17:02:58,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:02:58,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677851227] [2024-11-16 17:02:58,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677851227] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:02:58,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:02:58,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:02:58,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130308816] [2024-11-16 17:02:58,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:02:58,083 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:02:58,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:02:58,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:02:58,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:02:58,084 INFO L87 Difference]: Start difference. First operand 308 states and 478 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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-16 17:02:58,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:02:58,356 INFO L93 Difference]: Finished difference Result 761 states and 1174 transitions. [2024-11-16 17:02:58,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:02:58,356 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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-16 17:02:58,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:02:58,362 INFO L225 Difference]: With dead ends: 761 [2024-11-16 17:02:58,364 INFO L226 Difference]: Without dead ends: 456 [2024-11-16 17:02:58,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 66 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-16 17:02:58,369 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 107 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:02:58,369 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 408 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 17:02:58,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 456 states. [2024-11-16 17:02:58,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 456 to 414. [2024-11-16 17:02:58,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 414 states, 285 states have (on average 1.3929824561403508) internal successors, (397), 285 states have internal predecessors, (397), 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-16 17:02:58,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 414 states to 414 states and 645 transitions. [2024-11-16 17:02:58,434 INFO L78 Accepts]: Start accepts. Automaton has 414 states and 645 transitions. Word has length 203 [2024-11-16 17:02:58,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:02:58,436 INFO L471 AbstractCegarLoop]: Abstraction has 414 states and 645 transitions. [2024-11-16 17:02:58,436 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (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-16 17:02:58,436 INFO L276 IsEmpty]: Start isEmpty. Operand 414 states and 645 transitions. [2024-11-16 17:02:58,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-16 17:02:58,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:58,456 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, 1, 1, 1] [2024-11-16 17:02:58,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-16 17:02:58,457 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:58,457 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:58,457 INFO L85 PathProgramCache]: Analyzing trace with hash -1630740527, now seen corresponding path program 1 times [2024-11-16 17:02:58,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:02:58,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2086297704] [2024-11-16 17:02:58,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:58,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:02:58,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:02:58,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:02:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:02:58,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:02:58,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:02:58,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,757 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:02:58,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:02:58,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:02:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:02:58,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:02:58,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:02:58,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,776 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:02:58,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:02:58,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,783 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:02:58,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:02:58,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,791 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:02:58,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:02:58,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,819 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:02:58,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,823 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:02:58,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,828 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:02:58,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:02:58,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:02:58,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:02:58,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,844 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:02:58,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:02:58,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:02:58,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:02:58,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:02:58,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:02:58,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:02:58,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:02:58,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:02:58,880 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-16 17:02:58,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:02:58,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2086297704] [2024-11-16 17:02:58,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2086297704] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:02:58,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:02:58,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:02:58,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012428796] [2024-11-16 17:02:58,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:02:58,883 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:02:58,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:02:58,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:02:58,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:02:58,884 INFO L87 Difference]: Start difference. First operand 414 states and 645 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-16 17:02:59,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:02:59,271 INFO L93 Difference]: Finished difference Result 819 states and 1269 transitions. [2024-11-16 17:02:59,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:02:59,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 207 [2024-11-16 17:02:59,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:02:59,276 INFO L225 Difference]: With dead ends: 819 [2024-11-16 17:02:59,276 INFO L226 Difference]: Without dead ends: 470 [2024-11-16 17:02:59,277 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2024-11-16 17:02:59,282 INFO L432 NwaCegarLoop]: 152 mSDtfsCounter, 175 mSDsluCounter, 496 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 648 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-16 17:02:59,283 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [175 Valid, 648 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-16 17:02:59,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-16 17:02:59,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 413. [2024-11-16 17:02:59,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 413 states, 284 states have (on average 1.3873239436619718) internal successors, (394), 284 states have internal predecessors, (394), 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-16 17:02:59,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 413 states to 413 states and 642 transitions. [2024-11-16 17:02:59,336 INFO L78 Accepts]: Start accepts. Automaton has 413 states and 642 transitions. Word has length 207 [2024-11-16 17:02:59,338 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:02:59,338 INFO L471 AbstractCegarLoop]: Abstraction has 413 states and 642 transitions. [2024-11-16 17:02:59,338 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-16 17:02:59,339 INFO L276 IsEmpty]: Start isEmpty. Operand 413 states and 642 transitions. [2024-11-16 17:02:59,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-16 17:02:59,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:02:59,341 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, 1, 1, 1] [2024-11-16 17:02:59,341 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-16 17:02:59,341 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:02:59,341 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:02:59,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1697747280, now seen corresponding path program 1 times [2024-11-16 17:02:59,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:02:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134840939] [2024-11-16 17:02:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:02:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:02:59,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,809 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:03:00,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:03:00,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:03:00,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:03:00,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:03:00,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,831 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:03:00,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,835 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:03:00,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:03:00,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:03:00,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:03:00,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:03:00,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:03:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,861 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:03:00,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,865 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:03:00,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:03:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,873 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:03:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,877 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:03:00,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:03:00,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:03:00,886 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,889 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:03:00,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,892 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:03:00,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,896 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:03:00,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:03:00,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:03:00,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,908 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:03:00,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:03:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,916 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:03:00,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:03:00,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,924 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:03:00,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:03:00,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:03:00,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:00,938 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-16 17:03:00,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:03:00,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134840939] [2024-11-16 17:03:00,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134840939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:00,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:00,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-16 17:03:00,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211942064] [2024-11-16 17:03:00,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:00,940 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-16 17:03:00,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:03:00,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-16 17:03:00,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-16 17:03:00,942 INFO L87 Difference]: Start difference. First operand 413 states and 642 transitions. Second operand has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-16 17:03:01,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:01,405 INFO L93 Difference]: Finished difference Result 1065 states and 1658 transitions. [2024-11-16 17:03:01,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:03:01,406 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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 207 [2024-11-16 17:03:01,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:01,411 INFO L225 Difference]: With dead ends: 1065 [2024-11-16 17:03:01,411 INFO L226 Difference]: Without dead ends: 741 [2024-11-16 17:03:01,412 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:03:01,413 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 83 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 474 SdHoareTripleChecker+Invalid, 302 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:01,413 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 474 Invalid, 302 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-16 17:03:01,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 741 states. [2024-11-16 17:03:01,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 741 to 734. [2024-11-16 17:03:01,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 734 states, 509 states have (on average 1.381139489194499) internal successors, (703), 509 states have internal predecessors, (703), 217 states have call successors, (217), 7 states have call predecessors, (217), 7 states have return successors, (217), 217 states have call predecessors, (217), 217 states have call successors, (217) [2024-11-16 17:03:01,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 734 states and 1137 transitions. [2024-11-16 17:03:01,484 INFO L78 Accepts]: Start accepts. Automaton has 734 states and 1137 transitions. Word has length 207 [2024-11-16 17:03:01,484 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:01,484 INFO L471 AbstractCegarLoop]: Abstraction has 734 states and 1137 transitions. [2024-11-16 17:03:01,485 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 9.166666666666666) internal successors, (55), 6 states have internal predecessors, (55), 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-16 17:03:01,485 INFO L276 IsEmpty]: Start isEmpty. Operand 734 states and 1137 transitions. [2024-11-16 17:03:01,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 208 [2024-11-16 17:03:01,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:01,487 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, 1, 1, 1] [2024-11-16 17:03:01,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-16 17:03:01,487 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:01,488 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:01,488 INFO L85 PathProgramCache]: Analyzing trace with hash -190195471, now seen corresponding path program 1 times [2024-11-16 17:03:01,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:03:01,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2099269379] [2024-11-16 17:03:01,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:01,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:03:01,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:03:02,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:03:02,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:03:02,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:03:02,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:03:02,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:03:02,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,046 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:03:02,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:03:02,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:03:02,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:03:02,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,066 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:03:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:03:02,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:03:02,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:03:02,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:03:02,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:03:02,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:03:02,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:03:02,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:03:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:03:02,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:03:02,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:03:02,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:03:02,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:03:02,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:03:02,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:03:02,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:03:02,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:03:02,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:03:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:03:02,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:03:02,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,147 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-16 17:03:02,147 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:03:02,148 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2099269379] [2024-11-16 17:03:02,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2099269379] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:02,148 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:02,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-16 17:03:02,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236047774] [2024-11-16 17:03:02,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:02,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:03:02,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:03:02,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:03:02,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:03:02,149 INFO L87 Difference]: Start difference. First operand 734 states and 1137 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-16 17:03:02,429 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:02,430 INFO L93 Difference]: Finished difference Result 1785 states and 2754 transitions. [2024-11-16 17:03:02,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:03:02,431 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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 207 [2024-11-16 17:03:02,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:02,438 INFO L225 Difference]: With dead ends: 1785 [2024-11-16 17:03:02,438 INFO L226 Difference]: Without dead ends: 1160 [2024-11-16 17:03:02,441 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:03:02,442 INFO L432 NwaCegarLoop]: 172 mSDtfsCounter, 259 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 259 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 226 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:02,443 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [259 Valid, 522 Invalid, 226 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-16 17:03:02,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1160 states. [2024-11-16 17:03:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1160 to 951. [2024-11-16 17:03:02,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 951 states, 662 states have (on average 1.3791540785498488) internal successors, (913), 662 states have internal predecessors, (913), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279) [2024-11-16 17:03:02,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 951 states to 951 states and 1471 transitions. [2024-11-16 17:03:02,543 INFO L78 Accepts]: Start accepts. Automaton has 951 states and 1471 transitions. Word has length 207 [2024-11-16 17:03:02,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:02,544 INFO L471 AbstractCegarLoop]: Abstraction has 951 states and 1471 transitions. [2024-11-16 17:03:02,544 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 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-16 17:03:02,545 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1471 transitions. [2024-11-16 17:03:02,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-16 17:03:02,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:02,547 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, 1, 1, 1, 1] [2024-11-16 17:03:02,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-16 17:03:02,547 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:02,547 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:02,548 INFO L85 PathProgramCache]: Analyzing trace with hash -647968814, now seen corresponding path program 1 times [2024-11-16 17:03:02,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:03:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1807708041] [2024-11-16 17:03:02,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:03:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:03:02,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:03:02,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:03:02,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,643 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:03:02,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:03:02,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:03:02,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,649 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:03:02,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:03:02,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:03:02,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:03:02,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:03:02,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:03:02,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:03:02,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:03:02,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:03:02,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:03:02,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:03:02,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:03:02,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:03:02,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:03:02,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:03:02,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:03:02,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:03:02,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:03:02,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:03:02,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:03:02,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:03:02,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:03:02,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:03:02,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:03:02,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:03:02,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:02,723 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-16 17:03:02,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:03:02,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1807708041] [2024-11-16 17:03:02,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1807708041] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:02,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:02,723 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:03:02,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113743183] [2024-11-16 17:03:02,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:02,724 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:03:02,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:03:02,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:03:02,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:03:02,727 INFO L87 Difference]: Start difference. First operand 951 states and 1471 transitions. Second operand has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-16 17:03:02,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:02,840 INFO L93 Difference]: Finished difference Result 2277 states and 3497 transitions. [2024-11-16 17:03:02,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:03:02,841 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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 208 [2024-11-16 17:03:02,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:02,849 INFO L225 Difference]: With dead ends: 2277 [2024-11-16 17:03:02,849 INFO L226 Difference]: Without dead ends: 1397 [2024-11-16 17:03:02,854 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-16 17:03:02,855 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 53 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:02,856 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 296 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:03:02,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1397 states. [2024-11-16 17:03:02,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1397 to 1245. [2024-11-16 17:03:02,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1245 states, 956 states have (on average 1.4121338912133892) internal successors, (1350), 956 states have internal predecessors, (1350), 279 states have call successors, (279), 9 states have call predecessors, (279), 9 states have return successors, (279), 279 states have call predecessors, (279), 279 states have call successors, (279) [2024-11-16 17:03:02,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1245 states to 1245 states and 1908 transitions. [2024-11-16 17:03:02,979 INFO L78 Accepts]: Start accepts. Automaton has 1245 states and 1908 transitions. Word has length 208 [2024-11-16 17:03:02,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:02,979 INFO L471 AbstractCegarLoop]: Abstraction has 1245 states and 1908 transitions. [2024-11-16 17:03:02,979 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 18.666666666666668) internal successors, (56), 3 states have internal predecessors, (56), 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-16 17:03:02,980 INFO L276 IsEmpty]: Start isEmpty. Operand 1245 states and 1908 transitions. [2024-11-16 17:03:02,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-16 17:03:02,983 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:02,983 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, 1, 1, 1, 1] [2024-11-16 17:03:02,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-16 17:03:02,983 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:02,984 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:02,984 INFO L85 PathProgramCache]: Analyzing trace with hash 705340883, now seen corresponding path program 1 times [2024-11-16 17:03:02,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:03:02,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1212572256] [2024-11-16 17:03:02,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:02,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:03:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:03:03,326 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1786529132] [2024-11-16 17:03:03,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:03,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:03:03,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:03:03,329 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:03:03,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 17:03:03,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:03,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 514 conjuncts, 82 conjuncts are in the unsatisfiable core [2024-11-16 17:03:03,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:09,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 1531 proven. 135 refuted. 0 times theorem prover too weak. 194 trivial. 0 not checked. [2024-11-16 17:03:09,377 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:03:20,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:03:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1212572256] [2024-11-16 17:03:20,321 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-16 17:03:20,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1786529132] [2024-11-16 17:03:20,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1786529132] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:03:20,322 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-16 17:03:20,322 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49] total 49 [2024-11-16 17:03:20,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375294759] [2024-11-16 17:03:20,322 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-16 17:03:20,323 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2024-11-16 17:03:20,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:03:20,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2024-11-16 17:03:20,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=658, Invalid=3002, Unknown=0, NotChecked=0, Total=3660 [2024-11-16 17:03:20,327 INFO L87 Difference]: Start difference. First operand 1245 states and 1908 transitions. Second operand has 50 states, 50 states have (on average 2.14) internal successors, (107), 43 states have internal predecessors, (107), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-16 17:03:24,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:24,346 INFO L93 Difference]: Finished difference Result 2273 states and 3351 transitions. [2024-11-16 17:03:24,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 57 states. [2024-11-16 17:03:24,347 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 2.14) internal successors, (107), 43 states have internal predecessors, (107), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) Word has length 208 [2024-11-16 17:03:24,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:24,361 INFO L225 Difference]: With dead ends: 2273 [2024-11-16 17:03:24,361 INFO L226 Difference]: Without dead ends: 1865 [2024-11-16 17:03:24,369 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 297 GetRequests, 186 SyntacticMatches, 0 SemanticMatches, 111 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3404 ImplicationChecksByTransitivity, 8.0s TimeCoverageRelationStatistics Valid=2252, Invalid=10404, Unknown=0, NotChecked=0, Total=12656 [2024-11-16 17:03:24,371 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 657 mSDsluCounter, 1555 mSDsCounter, 0 mSdLazyCounter, 1823 mSolverCounterSat, 167 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 657 SdHoareTripleChecker+Valid, 1721 SdHoareTripleChecker+Invalid, 1990 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 167 IncrementalHoareTripleChecker+Valid, 1823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:24,372 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [657 Valid, 1721 Invalid, 1990 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [167 Valid, 1823 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 17:03:24,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1865 states. [2024-11-16 17:03:24,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1865 to 1765. [2024-11-16 17:03:24,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1340 states have (on average 1.3604477611940298) internal successors, (1823), 1349 states have internal predecessors, (1823), 390 states have call successors, (390), 34 states have call predecessors, (390), 34 states have return successors, (390), 381 states have call predecessors, (390), 390 states have call successors, (390) [2024-11-16 17:03:24,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2603 transitions. [2024-11-16 17:03:24,559 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2603 transitions. Word has length 208 [2024-11-16 17:03:24,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:24,560 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2603 transitions. [2024-11-16 17:03:24,560 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 2.14) internal successors, (107), 43 states have internal predecessors, (107), 13 states have call successors, (31), 13 states have call predecessors, (31), 18 states have return successors, (31), 14 states have call predecessors, (31), 13 states have call successors, (31) [2024-11-16 17:03:24,560 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2603 transitions. [2024-11-16 17:03:24,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-16 17:03:24,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:24,563 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, 1, 1, 1, 1] [2024-11-16 17:03:24,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 17:03:24,764 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-16 17:03:24,764 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:24,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:24,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1672071284, now seen corresponding path program 1 times [2024-11-16 17:03:24,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:03:24,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371555789] [2024-11-16 17:03:24,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:24,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:03:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:03:25,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:03:25,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,052 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:03:25,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,053 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:03:25,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:03:25,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:03:25,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:03:25,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:03:25,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:03:25,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,065 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:03:25,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:03:25,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,072 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:03:25,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:03:25,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:03:25,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:03:25,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,078 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:03:25,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:03:25,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:03:25,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,087 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:03:25,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,088 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:03:25,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,089 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:03:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:03:25,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:03:25,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,094 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:03:25,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:03:25,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:03:25,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:03:25,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,099 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:03:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,101 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:03:25,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:03:25,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:03:25,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:25,108 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-16 17:03:25,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:03:25,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371555789] [2024-11-16 17:03:25,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371555789] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:25,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:25,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:03:25,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1563805278] [2024-11-16 17:03:25,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:25,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:03:25,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:03:25,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:03:25,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:03:25,111 INFO L87 Difference]: Start difference. First operand 1765 states and 2603 transitions. Second operand has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-16 17:03:25,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:25,289 INFO L93 Difference]: Finished difference Result 3458 states and 5083 transitions. [2024-11-16 17:03:25,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:03:25,289 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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 208 [2024-11-16 17:03:25,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:25,306 INFO L225 Difference]: With dead ends: 3458 [2024-11-16 17:03:25,306 INFO L226 Difference]: Without dead ends: 2059 [2024-11-16 17:03:25,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 65 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-16 17:03:25,312 INFO L432 NwaCegarLoop]: 165 mSDtfsCounter, 85 mSDsluCounter, 292 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:25,313 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 457 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 17:03:25,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2059 states. [2024-11-16 17:03:25,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2059 to 1765. [2024-11-16 17:03:25,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1765 states, 1340 states have (on average 1.3492537313432835) internal successors, (1808), 1349 states have internal predecessors, (1808), 390 states have call successors, (390), 34 states have call predecessors, (390), 34 states have return successors, (390), 381 states have call predecessors, (390), 390 states have call successors, (390) [2024-11-16 17:03:25,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1765 states to 1765 states and 2588 transitions. [2024-11-16 17:03:25,497 INFO L78 Accepts]: Start accepts. Automaton has 1765 states and 2588 transitions. Word has length 208 [2024-11-16 17:03:25,498 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:25,498 INFO L471 AbstractCegarLoop]: Abstraction has 1765 states and 2588 transitions. [2024-11-16 17:03:25,499 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 14.0) internal successors, (56), 4 states have internal predecessors, (56), 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-16 17:03:25,499 INFO L276 IsEmpty]: Start isEmpty. Operand 1765 states and 2588 transitions. [2024-11-16 17:03:25,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 209 [2024-11-16 17:03:25,501 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:25,502 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, 1, 1, 1, 1] [2024-11-16 17:03:25,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-16 17:03:25,503 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:25,503 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:25,504 INFO L85 PathProgramCache]: Analyzing trace with hash 827599413, now seen corresponding path program 1 times [2024-11-16 17:03:25,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:03:25,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089717323] [2024-11-16 17:03:25,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:25,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:03:25,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:26,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:03:26,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:26,985 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:03:26,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:26,990 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:03:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:26,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:03:26,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:26,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:03:26,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:03:27,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:03:27,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:03:27,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:03:27,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:03:27,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:03:27,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:03:27,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,036 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:03:27,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,041 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:03:27,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:03:27,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:03:27,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:03:27,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:03:27,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:03:27,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:03:27,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:03:27,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:03:27,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:03:27,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,131 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:03:27,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,141 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:03:27,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:03:27,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,154 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:03:27,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,163 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:03:27,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:03:27,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:03:27,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:03:27,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,194 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-16 17:03:27,194 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:03:27,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089717323] [2024-11-16 17:03:27,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2089717323] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 17:03:27,194 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [232735081] [2024-11-16 17:03:27,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:27,195 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:03:27,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:03:27,197 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:03:27,198 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 17:03:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:27,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-16 17:03:27,366 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:28,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 828 proven. 27 refuted. 0 times theorem prover too weak. 1005 trivial. 0 not checked. [2024-11-16 17:03:28,529 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 17:03:29,888 INFO L134 CoverageAnalysis]: Checked inductivity of 1860 backedges. 63 proven. 27 refuted. 0 times theorem prover too weak. 1770 trivial. 0 not checked. [2024-11-16 17:03:29,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [232735081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 17:03:29,888 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 17:03:29,888 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9, 10] total 27 [2024-11-16 17:03:29,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626188679] [2024-11-16 17:03:29,888 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 17:03:29,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-16 17:03:29,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:03:29,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-16 17:03:29,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=556, Unknown=0, NotChecked=0, Total=702 [2024-11-16 17:03:29,891 INFO L87 Difference]: Start difference. First operand 1765 states and 2588 transitions. Second operand has 27 states, 27 states have (on average 5.555555555555555) internal successors, (150), 27 states have internal predecessors, (150), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-16 17:03:32,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:32,054 INFO L93 Difference]: Finished difference Result 4358 states and 6405 transitions. [2024-11-16 17:03:32,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-16 17:03:32,056 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 5.555555555555555) internal successors, (150), 27 states have internal predecessors, (150), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) Word has length 208 [2024-11-16 17:03:32,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:32,076 INFO L225 Difference]: With dead ends: 4358 [2024-11-16 17:03:32,077 INFO L226 Difference]: Without dead ends: 3174 [2024-11-16 17:03:32,083 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 506 GetRequests, 466 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 283 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=422, Invalid=1300, Unknown=0, NotChecked=0, Total=1722 [2024-11-16 17:03:32,084 INFO L432 NwaCegarLoop]: 160 mSDtfsCounter, 335 mSDsluCounter, 1397 mSDsCounter, 0 mSdLazyCounter, 1602 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 1557 SdHoareTripleChecker+Invalid, 1966 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 1602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:32,084 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [344 Valid, 1557 Invalid, 1966 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 1602 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-16 17:03:32,087 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3174 states. [2024-11-16 17:03:32,390 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3174 to 2593. [2024-11-16 17:03:32,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2593 states, 1970 states have (on average 1.3395939086294417) internal successors, (2639), 1982 states have internal predecessors, (2639), 569 states have call successors, (569), 53 states have call predecessors, (569), 53 states have return successors, (569), 557 states have call predecessors, (569), 569 states have call successors, (569) [2024-11-16 17:03:32,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2593 states to 2593 states and 3777 transitions. [2024-11-16 17:03:32,413 INFO L78 Accepts]: Start accepts. Automaton has 2593 states and 3777 transitions. Word has length 208 [2024-11-16 17:03:32,413 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:32,413 INFO L471 AbstractCegarLoop]: Abstraction has 2593 states and 3777 transitions. [2024-11-16 17:03:32,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 5.555555555555555) internal successors, (150), 27 states have internal predecessors, (150), 6 states have call successors, (93), 3 states have call predecessors, (93), 6 states have return successors, (93), 6 states have call predecessors, (93), 6 states have call successors, (93) [2024-11-16 17:03:32,414 INFO L276 IsEmpty]: Start isEmpty. Operand 2593 states and 3777 transitions. [2024-11-16 17:03:32,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-16 17:03:32,417 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:32,417 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, 1, 1, 1, 1, 1] [2024-11-16 17:03:32,436 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-16 17:03:32,621 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-16 17:03:32,622 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:32,622 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:32,623 INFO L85 PathProgramCache]: Analyzing trace with hash -707062246, now seen corresponding path program 1 times [2024-11-16 17:03:32,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:03:32,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728449013] [2024-11-16 17:03:32,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:32,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:03:32,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-16 17:03:32,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-16 17:03:32,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-16 17:03:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-16 17:03:32,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-16 17:03:32,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-16 17:03:32,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,719 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-16 17:03:32,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-16 17:03:32,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-16 17:03:32,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-16 17:03:32,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-16 17:03:32,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,725 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-16 17:03:32,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,727 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-16 17:03:32,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 78 [2024-11-16 17:03:32,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,730 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-16 17:03:32,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 89 [2024-11-16 17:03:32,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-16 17:03:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 100 [2024-11-16 17:03:32,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,735 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-16 17:03:32,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,737 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-16 17:03:32,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-16 17:03:32,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,740 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 122 [2024-11-16 17:03:32,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,742 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-16 17:03:32,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 133 [2024-11-16 17:03:32,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,745 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-16 17:03:32,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 144 [2024-11-16 17:03:32,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-16 17:03:32,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,749 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 155 [2024-11-16 17:03:32,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-16 17:03:32,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 166 [2024-11-16 17:03:32,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 171 [2024-11-16 17:03:32,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:32,757 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-16 17:03:32,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 17:03:32,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728449013] [2024-11-16 17:03:32,758 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728449013] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:32,758 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:32,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:03:32,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [460169583] [2024-11-16 17:03:32,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:32,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:03:32,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 17:03:32,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:03:32,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:03:32,760 INFO L87 Difference]: Start difference. First operand 2593 states and 3777 transitions. Second operand has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-16 17:03:32,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:32,954 INFO L93 Difference]: Finished difference Result 4976 states and 7253 transitions. [2024-11-16 17:03:32,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:03:32,955 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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 209 [2024-11-16 17:03:32,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:32,974 INFO L225 Difference]: With dead ends: 4976 [2024-11-16 17:03:32,975 INFO L226 Difference]: Without dead ends: 3003 [2024-11-16 17:03:32,983 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-16 17:03:32,984 INFO L432 NwaCegarLoop]: 193 mSDtfsCounter, 55 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:32,984 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 324 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 17:03:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3003 states. [2024-11-16 17:03:33,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3003 to 2717. [2024-11-16 17:03:33,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2717 states, 2094 states have (on average 1.3390639923591212) internal successors, (2804), 2106 states have internal predecessors, (2804), 569 states have call successors, (569), 53 states have call predecessors, (569), 53 states have return successors, (569), 557 states have call predecessors, (569), 569 states have call successors, (569) [2024-11-16 17:03:33,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2717 states to 2717 states and 3942 transitions. [2024-11-16 17:03:33,279 INFO L78 Accepts]: Start accepts. Automaton has 2717 states and 3942 transitions. Word has length 209 [2024-11-16 17:03:33,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:33,280 INFO L471 AbstractCegarLoop]: Abstraction has 2717 states and 3942 transitions. [2024-11-16 17:03:33,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 19.0) internal successors, (57), 3 states have internal predecessors, (57), 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-16 17:03:33,280 INFO L276 IsEmpty]: Start isEmpty. Operand 2717 states and 3942 transitions. [2024-11-16 17:03:33,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 210 [2024-11-16 17:03:33,283 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:33,283 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, 1, 1, 1, 1, 1] [2024-11-16 17:03:33,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-16 17:03:33,283 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:33,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:33,284 INFO L85 PathProgramCache]: Analyzing trace with hash -695746119, now seen corresponding path program 1 times [2024-11-16 17:03:33,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 17:03:33,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150218402] [2024-11-16 17:03:33,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:33,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 17:03:33,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-16 17:03:33,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890494768] [2024-11-16 17:03:33,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:33,697 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:03:33,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:03:33,699 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-16 17:03:33,700 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 17:03:33,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:03:33,858 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-16 17:03:33,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-16 17:03:34,109 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-16 17:03:34,110 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-16 17:03:34,111 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-16 17:03:34,135 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-16 17:03:34,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 17:03:34,319 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 17:03:34,473 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-16 17:03:34,475 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 05:03:34 BoogieIcfgContainer [2024-11-16 17:03:34,476 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-16 17:03:34,477 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-16 17:03:34,477 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-16 17:03:34,477 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-16 17:03:34,478 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:02:54" (3/4) ... [2024-11-16 17:03:34,480 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-16 17:03:34,481 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-16 17:03:34,482 INFO L158 Benchmark]: Toolchain (without parser) took 41536.71ms. Allocated memory was 151.0MB in the beginning and 889.2MB in the end (delta: 738.2MB). Free memory was 120.5MB in the beginning and 510.3MB in the end (delta: -389.8MB). Peak memory consumption was 347.4MB. Max. memory is 16.1GB. [2024-11-16 17:03:34,482 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:03:34,482 INFO L158 Benchmark]: CACSL2BoogieTranslator took 497.21ms. Allocated memory is still 151.0MB. Free memory was 120.5MB in the beginning and 101.7MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-16 17:03:34,482 INFO L158 Benchmark]: Boogie Procedure Inliner took 74.57ms. Allocated memory is still 151.0MB. Free memory was 101.7MB in the beginning and 95.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-16 17:03:34,483 INFO L158 Benchmark]: Boogie Preprocessor took 106.21ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 84.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-16 17:03:34,483 INFO L158 Benchmark]: IcfgBuilder took 738.53ms. Allocated memory is still 151.0MB. Free memory was 83.9MB in the beginning and 47.2MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. [2024-11-16 17:03:34,484 INFO L158 Benchmark]: TraceAbstraction took 40105.33ms. Allocated memory was 151.0MB in the beginning and 889.2MB in the end (delta: 738.2MB). Free memory was 47.2MB in the beginning and 511.2MB in the end (delta: -464.1MB). Peak memory consumption was 274.0MB. Max. memory is 16.1GB. [2024-11-16 17:03:34,484 INFO L158 Benchmark]: Witness Printer took 4.32ms. Allocated memory is still 889.2MB. Free memory was 511.2MB in the beginning and 510.3MB in the end (delta: 901.1kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-16 17:03:34,486 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.21ms. Allocated memory is still 117.4MB. Free memory is still 90.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 497.21ms. Allocated memory is still 151.0MB. Free memory was 120.5MB in the beginning and 101.7MB in the end (delta: 18.8MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 74.57ms. Allocated memory is still 151.0MB. Free memory was 101.7MB in the beginning and 95.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 106.21ms. Allocated memory is still 151.0MB. Free memory was 95.4MB in the beginning and 84.9MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * IcfgBuilder took 738.53ms. Allocated memory is still 151.0MB. Free memory was 83.9MB in the beginning and 47.2MB in the end (delta: 36.7MB). Peak memory consumption was 37.7MB. Max. memory is 16.1GB. * TraceAbstraction took 40105.33ms. Allocated memory was 151.0MB in the beginning and 889.2MB in the end (delta: 738.2MB). Free memory was 47.2MB in the beginning and 511.2MB in the end (delta: -464.1MB). Peak memory consumption was 274.0MB. Max. memory is 16.1GB. * Witness Printer took 4.32ms. Allocated memory is still 889.2MB. Free memory was 511.2MB in the beginning and 510.3MB in the end (delta: 901.1kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryFLOATComparisonOperation at line 204, overapproximation of someBinaryDOUBLEComparisonOperation at line 204, overapproximation of bitwiseOr at line 204. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 32; [L23] signed short int var_1_6 = -1; [L24] unsigned char var_1_7 = 1; [L25] unsigned char var_1_8 = 1; [L26] signed char var_1_9 = -128; [L27] signed char var_1_12 = 10; [L28] signed char var_1_13 = -64; [L29] signed char var_1_14 = 1; [L30] signed char var_1_15 = -25; [L31] unsigned short int var_1_16 = 256; [L32] signed char var_1_18 = 4; [L33] float var_1_19 = 100.5; [L34] float var_1_20 = 4.5; [L35] signed char var_1_21 = 0; [L36] signed char var_1_22 = 64; [L37] signed char var_1_23 = 2; [L38] signed char var_1_24 = 4; [L39] unsigned long int var_1_25 = 8; [L40] unsigned char var_1_27 = 50; [L41] unsigned char var_1_28 = 5; [L42] signed short int var_1_29 = 32; [L43] signed long int var_1_30 = 1; [L44] signed long int var_1_31 = 0; [L45] unsigned char var_1_33 = 2; [L46] unsigned char var_1_34 = 128; [L47] unsigned char var_1_35 = 2; [L48] unsigned char var_1_36 = 200; [L49] unsigned char var_1_37 = 32; [L50] double var_1_38 = 10.3; [L51] signed short int var_1_39 = -256; [L52] signed short int last_1_var_1_6 = -1; [L53] signed char last_1_var_1_9 = -128; [L54] unsigned short int last_1_var_1_16 = 256; [L55] signed char last_1_var_1_18 = 4; [L56] float last_1_var_1_19 = 100.5; [L57] unsigned long int last_1_var_1_25 = 8; [L58] unsigned char last_1_var_1_27 = 50; [L59] signed short int last_1_var_1_29 = 32; [L60] unsigned char last_1_var_1_33 = 2; [L61] unsigned char last_1_var_1_35 = 2; VAL [isInitial=0, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L208] isInitial = 1 [L209] FCALL initially() [L210] COND TRUE 1 [L211] CALL updateLastVariables() [L192] last_1_var_1_6 = var_1_6 [L193] last_1_var_1_9 = var_1_9 [L194] last_1_var_1_16 = var_1_16 [L195] last_1_var_1_18 = var_1_18 [L196] last_1_var_1_19 = var_1_19 [L197] last_1_var_1_25 = var_1_25 [L198] last_1_var_1_27 = var_1_27 [L199] last_1_var_1_29 = var_1_29 [L200] last_1_var_1_33 = var_1_33 [L201] last_1_var_1_35 = var_1_35 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=1, var_1_8=1, var_1_9=-128] [L211] RET updateLastVariables() [L212] CALL updateVariables() [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_8=1, var_1_9=-128] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=1, var_1_9=-128] [L146] var_1_8 = __VERIFIER_nondet_uchar() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_9=-128] [L148] CALL assume_abort_if_not(var_1_8 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L148] RET assume_abort_if_not(var_1_8 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=10, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L149] var_1_12 = __VERIFIER_nondet_char() [L150] CALL assume_abort_if_not(var_1_12 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L150] RET assume_abort_if_not(var_1_12 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L151] CALL assume_abort_if_not(var_1_12 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L151] RET assume_abort_if_not(var_1_12 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=-64, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L152] var_1_13 = __VERIFIER_nondet_char() [L153] CALL assume_abort_if_not(var_1_13 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L153] RET assume_abort_if_not(var_1_13 >= -127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L154] CALL assume_abort_if_not(var_1_13 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L154] RET assume_abort_if_not(var_1_13 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=1, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L155] var_1_14 = __VERIFIER_nondet_char() [L156] CALL assume_abort_if_not(var_1_14 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L156] RET assume_abort_if_not(var_1_14 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L157] CALL assume_abort_if_not(var_1_14 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L157] RET assume_abort_if_not(var_1_14 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=-25, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L158] var_1_15 = __VERIFIER_nondet_char() [L159] CALL assume_abort_if_not(var_1_15 >= -63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L159] RET assume_abort_if_not(var_1_15 >= -63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L160] CALL assume_abort_if_not(var_1_15 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L160] RET assume_abort_if_not(var_1_15 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_20=9/2, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L161] var_1_20 = __VERIFIER_nondet_float() [L162] CALL assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L162] RET assume_abort_if_not((var_1_20 >= -922337.2036854765600e+13F && var_1_20 <= -1.0e-20F) || (var_1_20 <= 9223372.036854765600e+12F && var_1_20 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=64, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L163] var_1_22 = __VERIFIER_nondet_char() [L164] CALL assume_abort_if_not(var_1_22 >= -1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L164] RET assume_abort_if_not(var_1_22 >= -1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L165] CALL assume_abort_if_not(var_1_22 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L165] RET assume_abort_if_not(var_1_22 <= 126) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=2, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L166] var_1_23 = __VERIFIER_nondet_char() [L167] CALL assume_abort_if_not(var_1_23 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L167] RET assume_abort_if_not(var_1_23 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L168] CALL assume_abort_if_not(var_1_23 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L168] RET assume_abort_if_not(var_1_23 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=4, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L169] var_1_24 = __VERIFIER_nondet_char() [L170] CALL assume_abort_if_not(var_1_24 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L170] RET assume_abort_if_not(var_1_24 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L171] CALL assume_abort_if_not(var_1_24 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L171] RET assume_abort_if_not(var_1_24 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=5, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L172] var_1_28 = __VERIFIER_nondet_uchar() [L173] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L173] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L174] CALL assume_abort_if_not(var_1_28 <= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L174] RET assume_abort_if_not(var_1_28 <= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=1, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L175] var_1_30 = __VERIFIER_nondet_long() [L176] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L176] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L177] CALL assume_abort_if_not(var_1_30 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L177] RET assume_abort_if_not(var_1_30 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L178] var_1_31 = __VERIFIER_nondet_long() [L179] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L179] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L180] CALL assume_abort_if_not(var_1_31 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L180] RET assume_abort_if_not(var_1_31 <= 1) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=128, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L181] var_1_34 = __VERIFIER_nondet_uchar() [L182] CALL assume_abort_if_not(var_1_34 >= 127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L182] RET assume_abort_if_not(var_1_34 >= 127) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L183] CALL assume_abort_if_not(var_1_34 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L183] RET assume_abort_if_not(var_1_34 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=200, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L184] var_1_36 = __VERIFIER_nondet_uchar() [L185] CALL assume_abort_if_not(var_1_36 >= 190) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L185] RET assume_abort_if_not(var_1_36 >= 190) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L186] CALL assume_abort_if_not(var_1_36 <= 254) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L186] RET assume_abort_if_not(var_1_36 <= 254) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=32, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L187] var_1_37 = __VERIFIER_nondet_uchar() [L188] CALL assume_abort_if_not(var_1_37 >= 31) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L188] RET assume_abort_if_not(var_1_37 >= 31) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L189] CALL assume_abort_if_not(var_1_37 <= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L189] RET assume_abort_if_not(var_1_37 <= 63) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L212] RET updateVariables() [L213] CALL step() [L65] signed long int stepLocal_4 = last_1_var_1_9; [L66] signed long int stepLocal_3 = var_1_24 % var_1_34; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=61, stepLocal_4=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L67] COND FALSE !(last_1_var_1_16 <= stepLocal_4) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_3=61, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L70] COND TRUE stepLocal_3 >= last_1_var_1_27 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=2, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L71] COND FALSE !(\read(var_1_7)) [L74] var_1_33 = var_1_28 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L78] signed long int stepLocal_0 = 50 * last_1_var_1_29; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L79] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_0=1600, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L79] COND FALSE !((last_1_var_1_16 | last_1_var_1_9) >= stepLocal_0) [L82] COND FALSE !((last_1_var_1_19 + last_1_var_1_19) > 200.875f) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=201/2, var_1_1=32, var_1_21=0, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=50, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=103/10, var_1_39=-256, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L89] var_1_19 = var_1_20 [L90] var_1_21 = ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24))))) [L91] var_1_27 = ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28) [L92] var_1_38 = var_1_20 [L93] var_1_39 = 128 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=256, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L94] COND FALSE !(\read(var_1_7)) [L101] var_1_16 = var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L103] unsigned char stepLocal_2 = var_1_7; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=8, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L104] COND FALSE !(var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) [L109] var_1_25 = 2u VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L111] signed long int stepLocal_5 = var_1_30 + var_1_39; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, stepLocal_5=128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L112] COND TRUE (var_1_25 - last_1_var_1_35) <= stepLocal_5 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=2, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L113] COND FALSE !(\read(var_1_7)) [L116] var_1_35 = ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L119] unsigned short int stepLocal_1 = var_1_1; VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_1=32, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=4, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L120] COND TRUE stepLocal_1 <= var_1_35 [L121] var_1_18 = (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L125] EXPR var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=32, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L125] COND FALSE !((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) [L130] var_1_29 = (var_1_28 - var_1_30) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=-1, var_1_7=0, var_1_8=-255, var_1_9=-128] [L132] COND TRUE var_1_21 > var_1_29 [L133] var_1_6 = (var_1_21 - last_1_var_1_6) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, stepLocal_2=0, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=-255, var_1_9=-128] [L213] RET step() [L214] CALL, EXPR property() [L204] EXPR last_1_var_1_16 | last_1_var_1_9 VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=-255, var_1_9=-128] [L204] EXPR (((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30)))) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=-255, var_1_9=-128] [L204-L205] return (((((((((((((((last_1_var_1_16 | last_1_var_1_9) >= (50 * last_1_var_1_29)) ? (var_1_1 == ((unsigned short int) ((((last_1_var_1_9) < (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33))))) ? (last_1_var_1_9) : (((((last_1_var_1_16) > (last_1_var_1_33)) ? (last_1_var_1_16) : (last_1_var_1_33)))))))) : 1) && ((var_1_21 > var_1_29) ? (var_1_6 == ((signed short int) (var_1_21 - last_1_var_1_6))) : ((var_1_7 && var_1_8) ? (var_1_6 == ((signed short int) last_1_var_1_6)) : (var_1_6 == ((signed short int) -2))))) && (((last_1_var_1_19 + last_1_var_1_19) > 200.875f) ? ((last_1_var_1_25 > last_1_var_1_18) ? (var_1_9 == ((signed char) ((((var_1_12) > (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15)))))) ? (var_1_12) : (((((var_1_13) > ((var_1_14 + var_1_15))) ? (var_1_13) : ((var_1_14 + var_1_15))))))))) : (var_1_9 == ((signed char) ((((((((-32) < (100)) ? (-32) : (100)))) > (var_1_13)) ? (((((-32) < (100)) ? (-32) : (100)))) : (var_1_13)))))) : 1)) && (var_1_7 ? ((! var_1_8) ? (var_1_16 == ((unsigned short int) ((((var_1_27 + var_1_27) < 0 ) ? -(var_1_27 + var_1_27) : (var_1_27 + var_1_27))))) : (var_1_16 == ((unsigned short int) var_1_33))) : (var_1_16 == ((unsigned short int) var_1_9)))) && ((var_1_1 <= var_1_35) ? (var_1_18 == ((signed char) (((((((((4) < 0 ) ? -(4) : (4)))) < (var_1_15)) ? (((((4) < 0 ) ? -(4) : (4)))) : (var_1_15))) + var_1_14))) : (var_1_18 == ((signed char) var_1_13)))) && (var_1_19 == ((float) var_1_20))) && (var_1_21 == ((signed char) ((((var_1_12) < ((var_1_22 - (var_1_23 + var_1_24)))) ? (var_1_12) : ((var_1_22 - (var_1_23 + var_1_24)))))))) && ((var_1_38 <= ((((var_1_38) > (var_1_19)) ? (var_1_38) : (var_1_19)))) ? (((! (var_1_27 < var_1_27)) && var_1_7) ? (var_1_25 == ((unsigned long int) var_1_1)) : 1) : (var_1_25 == ((unsigned long int) 2u)))) && (var_1_27 == ((unsigned char) ((((((var_1_24 + 50)) > (var_1_23)) ? ((var_1_24 + 50)) : (var_1_23))) + var_1_28)))) && (((var_1_35 << ((((var_1_30) > (var_1_31)) ? (var_1_30) : (var_1_31)))) >= var_1_18) ? ((var_1_35 != ((((-64) > (var_1_23)) ? (-64) : (var_1_23)))) ? (var_1_29 == ((signed short int) (((((50 + var_1_23) - var_1_33) < 0 ) ? -((50 + var_1_23) - var_1_33) : ((50 + var_1_23) - var_1_33))))) : 1) : (var_1_29 == ((signed short int) (var_1_28 - var_1_30))))) && ((last_1_var_1_16 <= last_1_var_1_9) ? (var_1_33 == ((unsigned char) (var_1_34 - var_1_28))) : (((var_1_24 % var_1_34) >= last_1_var_1_27) ? (var_1_7 ? (var_1_33 == ((unsigned char) (((((((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) > ((64 - var_1_30))) ? (((((var_1_28) > (var_1_23)) ? (var_1_28) : (var_1_23)))) : ((64 - var_1_30)))) + 1))) : (var_1_33 == ((unsigned char) var_1_28))) : 1))) && (((var_1_25 - last_1_var_1_35) <= (var_1_30 + var_1_39)) ? (var_1_7 ? (var_1_35 == ((unsigned char) var_1_28)) : (var_1_35 == ((unsigned char) ((var_1_36 - (var_1_37 - var_1_30)) - ((((var_1_28) < (var_1_24)) ? (var_1_28) : (var_1_24))))))) : 1)) && (var_1_38 == ((double) var_1_20))) && (var_1_39 == ((signed short int) 128)) ; [L214] RET, EXPR property() [L214] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=-255, var_1_9=-128] [L19] reach_error() VAL [isInitial=1, last_1_var_1_16=256, last_1_var_1_18=4, last_1_var_1_19=201/2, last_1_var_1_25=8, last_1_var_1_27=50, last_1_var_1_29=32, last_1_var_1_33=2, last_1_var_1_35=2, last_1_var_1_6=-1, last_1_var_1_9=-128, var_1_12=126, var_1_13=0, var_1_14=63, var_1_15=63, var_1_16=-128, var_1_18=67, var_1_19=2, var_1_1=32, var_1_20=2, var_1_21=62, var_1_22=126, var_1_23=3, var_1_24=61, var_1_25=2, var_1_27=172, var_1_28=61, var_1_29=61, var_1_30=0, var_1_31=0, var_1_33=61, var_1_34=127, var_1_35=66, var_1_36=190, var_1_37=-449, var_1_38=2, var_1_39=128, var_1_6=63, var_1_7=0, var_1_8=-255, var_1_9=-128] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 105 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 39.8s, OverallIterations: 13, TraceHistogramMax: 31, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 9.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2202 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2193 mSDsluCounter, 7744 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5862 mSDsCounter, 1016 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4456 IncrementalHoareTripleChecker+Invalid, 5472 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1016 mSolverCounterUnsat, 1882 mSDtfsCounter, 4456 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1516 GetRequests, 1328 SyntacticMatches, 0 SemanticMatches, 188 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 3687 ImplicationChecksByTransitivity, 9.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=2717occurred in iteration=12, InterpolantAutomatonStates: 126, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 1.5s AutomataMinimizationTime, 12 MinimizatonAttempts, 1802 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 25.7s InterpolantComputationTime, 3306 NumberOfCodeBlocks, 3306 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 2874 ConstructedInterpolants, 1 QuantifiedInterpolants, 15479 SizeOfPredicates, 21 NumberOfNonLiveVariables, 1024 ConjunctsInSsa, 99 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 25824/26040 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-16 17:03:34,658 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/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_operatoramount_amount100_file-22.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 f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 17:03:36,933 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 17:03:37,019 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-16 17:03:37,026 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 17:03:37,027 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 17:03:37,057 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 17:03:37,058 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 17:03:37,058 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 17:03:37,059 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 17:03:37,060 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 17:03:37,061 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 17:03:37,061 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 17:03:37,062 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 17:03:37,062 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 17:03:37,064 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 17:03:37,065 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 17:03:37,065 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 17:03:37,065 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 17:03:37,066 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 17:03:37,066 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 17:03:37,069 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 17:03:37,070 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 17:03:37,071 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 17:03:37,071 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-16 17:03:37,071 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-16 17:03:37,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 17:03:37,072 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-16 17:03:37,072 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 17:03:37,072 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 17:03:37,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 17:03:37,073 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 17:03:37,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 17:03:37,073 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 17:03:37,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 17:03:37,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:03:37,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 17:03:37,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 17:03:37,075 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 17:03:37,075 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-16 17:03:37,075 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-16 17:03:37,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 17:03:37,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 17:03:37,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 17:03:37,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 17:03:37,079 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 -> f0881add29b2e913dccd0b5d11f581533e2263693d3a446dde3d837a9a510a5a [2024-11-16 17:03:37,461 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 17:03:37,485 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 17:03:37,489 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 17:03:37,491 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 17:03:37,491 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 17:03:37,493 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i [2024-11-16 17:03:39,113 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 17:03:39,370 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 17:03:39,372 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_operatoramount_amount100_file-22.i [2024-11-16 17:03:39,389 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbd5a911/29284bfb43944fe6911e6fca9590c0aa/FLAGc3fd49871 [2024-11-16 17:03:39,408 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4dbd5a911/29284bfb43944fe6911e6fca9590c0aa [2024-11-16 17:03:39,413 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 17:03:39,414 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 17:03:39,417 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 17:03:39,417 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 17:03:39,423 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 17:03:39,423 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:39,424 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fd5280d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39, skipping insertion in model container [2024-11-16 17:03:39,425 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:39,463 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 17:03:39,667 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_operatoramount_amount100_file-22.i[916,929] [2024-11-16 17:03:39,775 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:03:39,798 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 17:03:39,813 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_operatoramount_amount100_file-22.i[916,929] [2024-11-16 17:03:39,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 17:03:39,921 INFO L204 MainTranslator]: Completed translation [2024-11-16 17:03:39,922 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39 WrapperNode [2024-11-16 17:03:39,922 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 17:03:39,923 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 17:03:39,924 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 17:03:39,924 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 17:03:39,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:39,953 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,014 INFO L138 Inliner]: procedures = 27, calls = 44, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 210 [2024-11-16 17:03:40,015 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 17:03:40,020 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 17:03:40,020 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 17:03:40,020 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 17:03:40,035 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,036 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,043 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,065 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-16 17:03:40,066 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,066 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,079 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,085 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,090 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,097 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 17:03:40,098 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 17:03:40,098 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 17:03:40,099 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 17:03:40,099 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (1/1) ... [2024-11-16 17:03:40,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 17:03:40,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 17:03:40,138 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-16 17:03:40,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-16 17:03:40,174 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 17:03:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-16 17:03:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-16 17:03:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-16 17:03:40,175 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 17:03:40,175 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 17:03:40,296 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 17:03:40,298 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 17:03:41,440 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-16 17:03:41,440 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 17:03:41,460 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 17:03:41,461 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 17:03:41,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:03:41 BoogieIcfgContainer [2024-11-16 17:03:41,461 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 17:03:41,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 17:03:41,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 17:03:41,467 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 17:03:41,467 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 05:03:39" (1/3) ... [2024-11-16 17:03:41,468 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653d067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:03:41, skipping insertion in model container [2024-11-16 17:03:41,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 05:03:39" (2/3) ... [2024-11-16 17:03:41,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@653d067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 05:03:41, skipping insertion in model container [2024-11-16 17:03:41,470 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 05:03:41" (3/3) ... [2024-11-16 17:03:41,472 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_operatoramount_amount100_file-22.i [2024-11-16 17:03:41,488 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 17:03:41,489 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 17:03:41,567 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 17:03:41,573 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;@1a5a4036, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 17:03:41,574 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 17:03:41,579 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 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-16 17:03:41,603 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2024-11-16 17:03:41,603 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:41,604 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] [2024-11-16 17:03:41,605 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:41,610 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:41,610 INFO L85 PathProgramCache]: Analyzing trace with hash -816687847, now seen corresponding path program 1 times [2024-11-16 17:03:41,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:03:41,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [997710464] [2024-11-16 17:03:41,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:41,628 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:41,631 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:03:41,633 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:03:41,642 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-16 17:03:41,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:41,884 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 17:03:41,899 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:42,655 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-16 17:03:42,656 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:03:42,657 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:03:42,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [997710464] [2024-11-16 17:03:42,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [997710464] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:42,658 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:42,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:03:42,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455829784] [2024-11-16 17:03:42,661 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:42,666 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:03:42,666 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:03:42,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:03:42,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:03:42,698 INFO L87 Difference]: Start difference. First operand has 91 states, 57 states have (on average 1.3859649122807018) internal successors, (79), 58 states have internal predecessors, (79), 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 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-16 17:03:44,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:44,268 INFO L93 Difference]: Finished difference Result 281 states and 509 transitions. [2024-11-16 17:03:44,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:03:44,286 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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 196 [2024-11-16 17:03:44,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:44,296 INFO L225 Difference]: With dead ends: 281 [2024-11-16 17:03:44,296 INFO L226 Difference]: Without dead ends: 193 [2024-11-16 17:03:44,301 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:03:44,304 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 147 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 501 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:44,305 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [147 Valid, 501 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2024-11-16 17:03:44,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-16 17:03:44,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 165. [2024-11-16 17:03:44,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 100 states have (on average 1.34) internal successors, (134), 100 states have internal predecessors, (134), 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-16 17:03:44,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 258 transitions. [2024-11-16 17:03:44,390 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 258 transitions. Word has length 196 [2024-11-16 17:03:44,391 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:44,392 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 258 transitions. [2024-11-16 17:03:44,392 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.8) internal successors, (44), 4 states have internal predecessors, (44), 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-16 17:03:44,392 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 258 transitions. [2024-11-16 17:03:44,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-16 17:03:44,397 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:44,397 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] [2024-11-16 17:03:44,409 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-16 17:03:44,598 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:44,599 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:44,599 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:44,599 INFO L85 PathProgramCache]: Analyzing trace with hash -259869271, now seen corresponding path program 1 times [2024-11-16 17:03:44,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:03:44,601 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1315438713] [2024-11-16 17:03:44,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:44,601 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:44,601 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:03:44,605 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:03:44,606 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-16 17:03:44,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:44,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:03:44,853 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:46,478 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-16 17:03:46,478 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:03:46,478 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:03:46,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1315438713] [2024-11-16 17:03:46,478 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1315438713] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:46,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:46,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:03:46,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802202682] [2024-11-16 17:03:46,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:46,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:03:46,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:03:46,482 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:03:46,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:03:46,482 INFO L87 Difference]: Start difference. First operand 165 states and 258 transitions. Second operand has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-16 17:03:49,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:49,079 INFO L93 Difference]: Finished difference Result 442 states and 688 transitions. [2024-11-16 17:03:49,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-16 17:03:49,098 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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 197 [2024-11-16 17:03:49,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:49,107 INFO L225 Difference]: With dead ends: 442 [2024-11-16 17:03:49,107 INFO L226 Difference]: Without dead ends: 280 [2024-11-16 17:03:49,109 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 193 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:03:49,114 INFO L432 NwaCegarLoop]: 135 mSDtfsCounter, 129 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 451 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:49,115 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 451 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-16 17:03:49,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2024-11-16 17:03:49,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 244. [2024-11-16 17:03:49,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 147 states have (on average 1.3333333333333333) internal successors, (196), 147 states have internal predecessors, (196), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-16 17:03:49,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 382 transitions. [2024-11-16 17:03:49,189 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 382 transitions. Word has length 197 [2024-11-16 17:03:49,190 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:49,191 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 382 transitions. [2024-11-16 17:03:49,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.0) internal successors, (45), 4 states have internal predecessors, (45), 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-16 17:03:49,191 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 382 transitions. [2024-11-16 17:03:49,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 198 [2024-11-16 17:03:49,194 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:49,195 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] [2024-11-16 17:03:49,207 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-16 17:03:49,395 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:49,396 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:49,397 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:49,397 INFO L85 PathProgramCache]: Analyzing trace with hash 1093440426, now seen corresponding path program 1 times [2024-11-16 17:03:49,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:03:49,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2031825408] [2024-11-16 17:03:49,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:49,399 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:49,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:03:49,401 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:03:49,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-16 17:03:49,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:49,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 17:03:49,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:51,157 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-16 17:03:51,157 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:03:51,157 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:03:51,157 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2031825408] [2024-11-16 17:03:51,157 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2031825408] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:51,158 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:51,158 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:03:51,158 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [724050175] [2024-11-16 17:03:51,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:51,159 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-16 17:03:51,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:03:51,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-16 17:03:51,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-16 17:03:51,162 INFO L87 Difference]: Start difference. First operand 244 states and 382 transitions. Second operand has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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-16 17:03:52,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:52,849 INFO L93 Difference]: Finished difference Result 412 states and 642 transitions. [2024-11-16 17:03:52,863 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-16 17:03:52,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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 197 [2024-11-16 17:03:52,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:52,867 INFO L225 Difference]: With dead ends: 412 [2024-11-16 17:03:52,867 INFO L226 Difference]: Without dead ends: 171 [2024-11-16 17:03:52,868 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 194 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-16 17:03:52,870 INFO L432 NwaCegarLoop]: 126 mSDtfsCounter, 74 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:52,870 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 370 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2024-11-16 17:03:52,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2024-11-16 17:03:52,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 146. [2024-11-16 17:03:52,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 81 states have (on average 1.2469135802469136) internal successors, (101), 81 states have internal predecessors, (101), 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-16 17:03:52,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 225 transitions. [2024-11-16 17:03:52,893 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 225 transitions. Word has length 197 [2024-11-16 17:03:52,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:52,894 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 225 transitions. [2024-11-16 17:03:52,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.25) internal successors, (45), 3 states have internal predecessors, (45), 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-16 17:03:52,894 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 225 transitions. [2024-11-16 17:03:52,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 199 [2024-11-16 17:03:52,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:52,897 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] [2024-11-16 17:03:52,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-16 17:03:53,097 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:53,098 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:53,099 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:53,099 INFO L85 PathProgramCache]: Analyzing trace with hash 1615206075, now seen corresponding path program 1 times [2024-11-16 17:03:53,100 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:03:53,100 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1509693194] [2024-11-16 17:03:53,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:53,100 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:53,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:03:53,106 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:03:53,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-16 17:03:53,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:53,284 INFO L255 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-16 17:03:53,288 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:53,706 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-16 17:03:53,706 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:03:53,707 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:03:53,707 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1509693194] [2024-11-16 17:03:53,707 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1509693194] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:53,707 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:53,707 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-16 17:03:53,707 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370996640] [2024-11-16 17:03:53,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:53,709 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-16 17:03:53,709 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:03:53,709 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-16 17:03:53,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-16 17:03:53,714 INFO L87 Difference]: Start difference. First operand 146 states and 225 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 17:03:54,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:54,899 INFO L93 Difference]: Finished difference Result 345 states and 530 transitions. [2024-11-16 17:03:54,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 17:03:54,916 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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 198 [2024-11-16 17:03:54,916 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:54,919 INFO L225 Difference]: With dead ends: 345 [2024-11-16 17:03:54,919 INFO L226 Difference]: Without dead ends: 262 [2024-11-16 17:03:54,920 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 194 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-16 17:03:54,921 INFO L432 NwaCegarLoop]: 144 mSDtfsCounter, 169 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:54,921 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 448 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 17:03:54,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2024-11-16 17:03:54,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 227. [2024-11-16 17:03:54,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 130 states have (on average 1.2846153846153847) internal successors, (167), 130 states have internal predecessors, (167), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-16 17:03:54,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 353 transitions. [2024-11-16 17:03:54,961 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 353 transitions. Word has length 198 [2024-11-16 17:03:54,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:54,962 INFO L471 AbstractCegarLoop]: Abstraction has 227 states and 353 transitions. [2024-11-16 17:03:54,962 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 4 states have internal predecessors, (46), 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-16 17:03:54,962 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 353 transitions. [2024-11-16 17:03:54,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 17:03:54,964 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:54,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] [2024-11-16 17:03:54,976 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-16 17:03:55,165 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:55,166 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:55,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:55,166 INFO L85 PathProgramCache]: Analyzing trace with hash 1063521935, now seen corresponding path program 1 times [2024-11-16 17:03:55,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:03:55,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [54505196] [2024-11-16 17:03:55,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:55,167 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:55,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:03:55,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-16 17:03:55,171 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-16 17:03:55,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:55,349 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-16 17:03:55,353 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 17:03:55,377 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-16 17:03:55,377 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-16 17:03:55,377 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-16 17:03:55,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [54505196] [2024-11-16 17:03:55,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [54505196] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 17:03:55,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 17:03:55,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 17:03:55,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1165771576] [2024-11-16 17:03:55,378 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 17:03:55,378 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 17:03:55,378 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-16 17:03:55,379 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 17:03:55,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:03:55,380 INFO L87 Difference]: Start difference. First operand 227 states and 353 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-16 17:03:56,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 17:03:56,544 INFO L93 Difference]: Finished difference Result 448 states and 694 transitions. [2024-11-16 17:03:56,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 17:03:56,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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 199 [2024-11-16 17:03:56,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 17:03:56,547 INFO L225 Difference]: With dead ends: 448 [2024-11-16 17:03:56,548 INFO L226 Difference]: Without dead ends: 284 [2024-11-16 17:03:56,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 197 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 17:03:56,549 INFO L432 NwaCegarLoop]: 140 mSDtfsCounter, 32 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-16 17:03:56,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 259 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-16 17:03:56,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 284 states. [2024-11-16 17:03:56,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 284 to 267. [2024-11-16 17:03:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 170 states have (on average 1.3352941176470587) internal successors, (227), 170 states have internal predecessors, (227), 93 states have call successors, (93), 3 states have call predecessors, (93), 3 states have return successors, (93), 93 states have call predecessors, (93), 93 states have call successors, (93) [2024-11-16 17:03:56,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 413 transitions. [2024-11-16 17:03:56,577 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 413 transitions. Word has length 199 [2024-11-16 17:03:56,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 17:03:56,577 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 413 transitions. [2024-11-16 17:03:56,578 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 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-16 17:03:56,578 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 413 transitions. [2024-11-16 17:03:56,580 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2024-11-16 17:03:56,580 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 17:03:56,580 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] [2024-11-16 17:03:56,592 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 (6)] Forceful destruction successful, exit code 0 [2024-11-16 17:03:56,780 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-16 17:03:56,781 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 17:03:56,781 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 17:03:56,782 INFO L85 PathProgramCache]: Analyzing trace with hash 867008430, now seen corresponding path program 1 times [2024-11-16 17:03:56,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-16 17:03:56,782 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1337404963] [2024-11-16 17:03:56,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 17:03:56,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-16 17:03:56,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-16 17:03:56,785 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-16 17:03:56,787 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-16 17:03:56,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 17:03:56,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 337 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-16 17:03:56,978 INFO L278 TraceCheckSpWp]: Computing forward predicates...