./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.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 be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:00:59,738 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:00:59,824 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-10 05:00:59,833 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:00:59,834 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:00:59,863 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:00:59,864 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:00:59,864 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:00:59,865 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:00:59,866 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:00:59,866 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:00:59,867 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:00:59,867 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:00:59,869 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:00:59,869 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:00:59,870 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:00:59,870 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:00:59,870 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:00:59,871 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 05:00:59,871 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:00:59,871 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:00:59,875 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:00:59,876 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:00:59,876 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:00:59,876 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:00:59,876 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:00:59,876 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:00:59,877 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:00:59,877 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:00:59,877 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:00:59,877 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:00:59,878 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:00:59,878 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:00:59,878 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:00:59,878 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:00:59,878 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:00:59,879 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 05:00:59,879 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 05:00:59,881 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:00:59,881 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:00:59,881 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:00:59,882 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:00:59,882 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 -> be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 [2024-11-10 05:01:00,214 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:01:00,239 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:01:00,242 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:01:00,243 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:01:00,244 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:01:00,245 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-10 05:01:01,797 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:01:02,035 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:01:02,036 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-10 05:01:02,046 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e094a4086/60941d22f19e442eba0849fd69a743a7/FLAGcdfc9caa7 [2024-11-10 05:01:02,060 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e094a4086/60941d22f19e442eba0849fd69a743a7 [2024-11-10 05:01:02,063 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:01:02,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:01:02,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:01:02,070 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:01:02,076 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:01:02,077 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,079 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a56f043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02, skipping insertion in model container [2024-11-10 05:01:02,079 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,114 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:01:02,318 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i[919,932] [2024-11-10 05:01:02,401 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:01:02,413 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:01:02,423 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i[919,932] [2024-11-10 05:01:02,465 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:01:02,484 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:01:02,485 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02 WrapperNode [2024-11-10 05:01:02,487 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:01:02,489 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:01:02,489 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:01:02,489 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:01:02,496 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,507 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,571 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 239 [2024-11-10 05:01:02,572 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:01:02,572 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:01:02,573 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:01:02,573 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:01:02,583 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,583 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,588 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,641 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:01:02,642 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,642 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,661 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,662 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,665 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,667 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,672 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:01:02,673 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:01:02,673 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:01:02,673 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:01:02,674 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (1/1) ... [2024-11-10 05:01:02,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:01:02,701 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:01:02,721 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:01:02,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:01:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:01:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:01:02,766 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:01:02,766 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-10 05:01:02,767 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:01:02,767 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:01:02,849 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:01:02,851 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:01:03,323 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint L190: havoc property_#t~bitwise22#1;havoc property_#t~short23#1; [2024-11-10 05:01:03,373 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-10 05:01:03,374 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:01:03,399 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:01:03,400 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:01:03,400 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:01:03 BoogieIcfgContainer [2024-11-10 05:01:03,400 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:01:03,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:01:03,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:01:03,406 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:01:03,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:01:02" (1/3) ... [2024-11-10 05:01:03,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539a58a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:01:03, skipping insertion in model container [2024-11-10 05:01:03,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:02" (2/3) ... [2024-11-10 05:01:03,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@539a58a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:01:03, skipping insertion in model container [2024-11-10 05:01:03,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:01:03" (3/3) ... [2024-11-10 05:01:03,410 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-10 05:01:03,432 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:01:03,433 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:01:03,493 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:01:03,504 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;@7dcd4992, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:01:03,504 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:01:03,509 INFO L276 IsEmpty]: Start isEmpty. Operand has 103 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:01:03,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:01:03,531 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:03,533 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:03,533 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:03,540 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:03,541 INFO L85 PathProgramCache]: Analyzing trace with hash 1260473797, now seen corresponding path program 1 times [2024-11-10 05:01:03,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:03,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016875950] [2024-11-10 05:01:03,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:03,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:03,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,900 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:03,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:03,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:03,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:03,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,937 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:03,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,946 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:03,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:03,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,957 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:03,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:03,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,972 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:03,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:04,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:04,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:04,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:04,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:04,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,024 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:04,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,028 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:04,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:04,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:04,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,038 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:04,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:04,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:04,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:04,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:04,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,069 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:04,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,077 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:04,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,088 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:04,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:04,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016875950] [2024-11-10 05:01:04,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1016875950] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:04,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:04,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:01:04,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1709024072] [2024-11-10 05:01:04,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:04,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:01:04,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:04,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:01:04,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:01:04,128 INFO L87 Difference]: Start difference. First operand has 103 states, 72 states have (on average 1.4444444444444444) internal successors, (104), 73 states have internal predecessors, (104), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:01:04,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:04,173 INFO L93 Difference]: Finished difference Result 198 states and 341 transitions. [2024-11-10 05:01:04,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:01:04,176 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 186 [2024-11-10 05:01:04,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:04,183 INFO L225 Difference]: With dead ends: 198 [2024-11-10 05:01:04,183 INFO L226 Difference]: Without dead ends: 98 [2024-11-10 05:01:04,187 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:01:04,190 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:04,190 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 147 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:01:04,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-11-10 05:01:04,234 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2024-11-10 05:01:04,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 68 states have (on average 1.411764705882353) internal successors, (96), 68 states have internal predecessors, (96), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:01:04,238 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 152 transitions. [2024-11-10 05:01:04,240 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 152 transitions. Word has length 186 [2024-11-10 05:01:04,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:04,240 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 152 transitions. [2024-11-10 05:01:04,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.5) internal successors, (49), 2 states have internal predecessors, (49), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:01:04,241 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 152 transitions. [2024-11-10 05:01:04,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:01:04,246 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:04,246 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:04,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 05:01:04,247 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:04,247 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:04,247 INFO L85 PathProgramCache]: Analyzing trace with hash -1001315613, now seen corresponding path program 1 times [2024-11-10 05:01:04,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:04,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809281163] [2024-11-10 05:01:04,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:04,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:04,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:04,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:04,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:04,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:04,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:04,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:04,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:04,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:04,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:04,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,688 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:04,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,696 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:04,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,711 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:04,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:04,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,732 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:04,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:04,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:04,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,748 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:04,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:04,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:04,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:04,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,766 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:04,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,769 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:04,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:04,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,777 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:04,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:04,785 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:04,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:04,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809281163] [2024-11-10 05:01:04,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809281163] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:04,789 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:04,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:01:04,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1415442735] [2024-11-10 05:01:04,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:04,791 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:01:04,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:04,792 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:01:04,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:01:04,795 INFO L87 Difference]: Start difference. First operand 98 states and 152 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:04,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:04,958 INFO L93 Difference]: Finished difference Result 281 states and 438 transitions. [2024-11-10 05:01:04,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:01:04,959 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-10 05:01:04,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:04,964 INFO L225 Difference]: With dead ends: 281 [2024-11-10 05:01:04,965 INFO L226 Difference]: Without dead ends: 186 [2024-11-10 05:01:04,966 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:01:04,969 INFO L432 NwaCegarLoop]: 235 mSDtfsCounter, 130 mSDsluCounter, 362 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 597 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:04,970 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [130 Valid, 597 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:01:04,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2024-11-10 05:01:05,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 104. [2024-11-10 05:01:05,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 74 states have (on average 1.4054054054054055) internal successors, (104), 74 states have internal predecessors, (104), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:01:05,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 160 transitions. [2024-11-10 05:01:05,005 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 160 transitions. Word has length 186 [2024-11-10 05:01:05,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:05,008 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 160 transitions. [2024-11-10 05:01:05,008 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:05,009 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 160 transitions. [2024-11-10 05:01:05,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:01:05,014 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:05,014 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:05,014 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 05:01:05,015 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:05,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:05,016 INFO L85 PathProgramCache]: Analyzing trace with hash -1294718620, now seen corresponding path program 1 times [2024-11-10 05:01:05,016 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:05,016 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1928832095] [2024-11-10 05:01:05,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:05,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:05,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,334 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:05,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:05,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:05,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:05,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:05,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:05,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:05,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,353 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:05,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:05,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:05,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:05,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:05,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:05,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:05,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:05,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,378 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:05,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:05,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,382 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:05,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:05,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,397 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:05,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:05,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,405 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:05,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,408 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:05,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:05,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,412 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:05,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:05,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:05,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:05,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:05,425 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:05,427 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:05,427 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1928832095] [2024-11-10 05:01:05,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1928832095] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:05,428 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:05,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 05:01:05,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729348544] [2024-11-10 05:01:05,428 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:05,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:01:05,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:05,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:01:05,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:01:05,431 INFO L87 Difference]: Start difference. First operand 104 states and 160 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:05,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:05,546 INFO L93 Difference]: Finished difference Result 259 states and 396 transitions. [2024-11-10 05:01:05,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:01:05,547 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-10 05:01:05,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:05,552 INFO L225 Difference]: With dead ends: 259 [2024-11-10 05:01:05,552 INFO L226 Difference]: Without dead ends: 158 [2024-11-10 05:01:05,553 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:01:05,556 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 75 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 381 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:05,557 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 381 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 05:01:05,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-10 05:01:05,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 154. [2024-11-10 05:01:05,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.3523809523809525) internal successors, (142), 106 states have internal predecessors, (142), 46 states have call successors, (46), 2 states have call predecessors, (46), 2 states have return successors, (46), 45 states have call predecessors, (46), 46 states have call successors, (46) [2024-11-10 05:01:05,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 234 transitions. [2024-11-10 05:01:05,579 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 234 transitions. Word has length 186 [2024-11-10 05:01:05,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:05,580 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 234 transitions. [2024-11-10 05:01:05,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:05,581 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 234 transitions. [2024-11-10 05:01:05,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-10 05:01:05,587 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:05,587 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:05,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 05:01:05,588 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:05,588 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:05,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1192794213, now seen corresponding path program 1 times [2024-11-10 05:01:05,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:05,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71400797] [2024-11-10 05:01:05,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:05,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:05,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:06,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:06,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,031 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:06,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,033 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:06,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:06,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:06,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:06,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:06,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,058 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:06,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:06,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,067 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:06,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,071 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:06,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,074 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:06,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,076 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:06,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,079 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:06,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:06,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,085 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:06,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,090 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:06,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:06,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:06,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:06,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,114 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:06,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:06,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:06,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:06,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:06,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,134 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:06,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:06,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:06,141 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:06,141 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71400797] [2024-11-10 05:01:06,141 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [71400797] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:06,141 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:06,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 05:01:06,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1938330891] [2024-11-10 05:01:06,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:06,142 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 05:01:06,142 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:06,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 05:01:06,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-10 05:01:06,143 INFO L87 Difference]: Start difference. First operand 154 states and 234 transitions. Second operand has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:06,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:06,527 INFO L93 Difference]: Finished difference Result 517 states and 784 transitions. [2024-11-10 05:01:06,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 05:01:06,527 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-10 05:01:06,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:06,533 INFO L225 Difference]: With dead ends: 517 [2024-11-10 05:01:06,533 INFO L226 Difference]: Without dead ends: 366 [2024-11-10 05:01:06,537 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 05:01:06,538 INFO L432 NwaCegarLoop]: 183 mSDtfsCounter, 169 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 86 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 709 SdHoareTripleChecker+Invalid, 277 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 86 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:06,539 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 709 Invalid, 277 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [86 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 05:01:06,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2024-11-10 05:01:06,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 303. [2024-11-10 05:01:06,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 206 states have (on average 1.3495145631067962) internal successors, (278), 208 states have internal predecessors, (278), 92 states have call successors, (92), 4 states have call predecessors, (92), 4 states have return successors, (92), 90 states have call predecessors, (92), 92 states have call successors, (92) [2024-11-10 05:01:06,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 462 transitions. [2024-11-10 05:01:06,572 INFO L78 Accepts]: Start accepts. Automaton has 303 states and 462 transitions. Word has length 186 [2024-11-10 05:01:06,573 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:06,573 INFO L471 AbstractCegarLoop]: Abstraction has 303 states and 462 transitions. [2024-11-10 05:01:06,574 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.166666666666666) internal successors, (49), 6 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:06,574 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 462 transitions. [2024-11-10 05:01:06,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-10 05:01:06,579 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:06,579 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:06,580 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 05:01:06,580 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:06,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:06,580 INFO L85 PathProgramCache]: Analyzing trace with hash -1313156482, now seen corresponding path program 1 times [2024-11-10 05:01:06,581 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:06,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2108197878] [2024-11-10 05:01:06,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:06,583 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:06,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:08,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:08,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:08,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:08,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:08,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:08,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,147 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:08,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:08,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,170 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:08,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:08,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:08,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:08,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:08,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,226 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:08,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,234 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:08,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:08,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,252 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:08,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:08,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:08,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:08,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:08,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:08,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:08,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,343 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:08,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:08,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:08,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:08,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:08,386 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:08,386 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:08,387 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2108197878] [2024-11-10 05:01:08,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2108197878] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:08,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 05:01:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043565620] [2024-11-10 05:01:08,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:08,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-10 05:01:08,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:08,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-10 05:01:08,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-10 05:01:08,390 INFO L87 Difference]: Start difference. First operand 303 states and 462 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:09,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:09,074 INFO L93 Difference]: Finished difference Result 789 states and 1191 transitions. [2024-11-10 05:01:09,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:01:09,075 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 187 [2024-11-10 05:01:09,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:09,083 INFO L225 Difference]: With dead ends: 789 [2024-11-10 05:01:09,083 INFO L226 Difference]: Without dead ends: 489 [2024-11-10 05:01:09,085 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2024-11-10 05:01:09,086 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 172 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 115 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 661 SdHoareTripleChecker+Invalid, 390 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 115 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:09,089 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 661 Invalid, 390 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [115 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-10 05:01:09,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 489 states. [2024-11-10 05:01:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 489 to 450. [2024-11-10 05:01:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 450 states, 322 states have (on average 1.3695652173913044) internal successors, (441), 324 states have internal predecessors, (441), 120 states have call successors, (120), 7 states have call predecessors, (120), 7 states have return successors, (120), 118 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-10 05:01:09,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 450 states to 450 states and 681 transitions. [2024-11-10 05:01:09,163 INFO L78 Accepts]: Start accepts. Automaton has 450 states and 681 transitions. Word has length 187 [2024-11-10 05:01:09,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:09,166 INFO L471 AbstractCegarLoop]: Abstraction has 450 states and 681 transitions. [2024-11-10 05:01:09,167 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 10 states have internal predecessors, (50), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 450 states and 681 transitions. [2024-11-10 05:01:09,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-10 05:01:09,169 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:09,169 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:09,169 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 05:01:09,169 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:09,170 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:09,170 INFO L85 PathProgramCache]: Analyzing trace with hash 928428608, now seen corresponding path program 1 times [2024-11-10 05:01:09,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:09,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281747148] [2024-11-10 05:01:09,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:09,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:09,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:09,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:09,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:09,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:09,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:09,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:09,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:09,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:09,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:09,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:09,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:09,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:09,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:09,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,620 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:09,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:09,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:09,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:09,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:09,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:09,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:09,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:09,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:09,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,672 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:09,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,676 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:09,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:09,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,691 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:09,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,696 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 60 proven. 21 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 05:01:09,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:09,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [281747148] [2024-11-10 05:01:09,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [281747148] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:01:09,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1254120059] [2024-11-10 05:01:09,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:09,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:01:09,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:01:09,700 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:01:09,701 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 05:01:09,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:09,856 INFO L255 TraceCheckSpWp]: Trace formula consists of 448 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-10 05:01:09,887 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:01:10,222 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 627 proven. 21 refuted. 0 times theorem prover too weak. 864 trivial. 0 not checked. [2024-11-10 05:01:10,222 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:01:10,802 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 60 proven. 21 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-10 05:01:10,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1254120059] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 05:01:10,803 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 05:01:10,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 10] total 20 [2024-11-10 05:01:10,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795194206] [2024-11-10 05:01:10,803 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 05:01:10,804 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-10 05:01:10,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:10,805 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-10 05:01:10,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2024-11-10 05:01:10,806 INFO L87 Difference]: Start difference. First operand 450 states and 681 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-10 05:01:18,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:18,260 INFO L93 Difference]: Finished difference Result 3663 states and 5122 transitions. [2024-11-10 05:01:18,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 152 states. [2024-11-10 05:01:18,261 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) Word has length 189 [2024-11-10 05:01:18,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:18,281 INFO L225 Difference]: With dead ends: 3663 [2024-11-10 05:01:18,281 INFO L226 Difference]: Without dead ends: 3284 [2024-11-10 05:01:18,291 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 607 GetRequests, 444 SyntacticMatches, 0 SemanticMatches, 163 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10729 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=5461, Invalid=21599, Unknown=0, NotChecked=0, Total=27060 [2024-11-10 05:01:18,292 INFO L432 NwaCegarLoop]: 346 mSDtfsCounter, 1690 mSDsluCounter, 1892 mSDsCounter, 0 mSdLazyCounter, 2764 mSolverCounterSat, 813 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1711 SdHoareTripleChecker+Valid, 2238 SdHoareTripleChecker+Invalid, 3577 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 813 IncrementalHoareTripleChecker+Valid, 2764 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.8s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:18,292 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1711 Valid, 2238 Invalid, 3577 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [813 Valid, 2764 Invalid, 0 Unknown, 0 Unchecked, 2.8s Time] [2024-11-10 05:01:18,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3284 states. [2024-11-10 05:01:18,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3284 to 2133. [2024-11-10 05:01:18,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2133 states, 1650 states have (on average 1.3387878787878789) internal successors, (2209), 1680 states have internal predecessors, (2209), 422 states have call successors, (422), 60 states have call predecessors, (422), 60 states have return successors, (422), 392 states have call predecessors, (422), 422 states have call successors, (422) [2024-11-10 05:01:18,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2133 states to 2133 states and 3053 transitions. [2024-11-10 05:01:18,521 INFO L78 Accepts]: Start accepts. Automaton has 2133 states and 3053 transitions. Word has length 189 [2024-11-10 05:01:18,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:18,522 INFO L471 AbstractCegarLoop]: Abstraction has 2133 states and 3053 transitions. [2024-11-10 05:01:18,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 20 states have internal predecessors, (110), 4 states have call successors, (42), 2 states have call predecessors, (42), 4 states have return successors, (44), 4 states have call predecessors, (44), 4 states have call successors, (44) [2024-11-10 05:01:18,523 INFO L276 IsEmpty]: Start isEmpty. Operand 2133 states and 3053 transitions. [2024-11-10 05:01:18,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-10 05:01:18,526 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:18,526 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:18,546 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-10 05:01:18,727 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-10 05:01:18,728 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:18,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:18,728 INFO L85 PathProgramCache]: Analyzing trace with hash -81357561, now seen corresponding path program 1 times [2024-11-10 05:01:18,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:18,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [135855463] [2024-11-10 05:01:18,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:18,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:18,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:19,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:19,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:19,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:19,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:19,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:19,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:19,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:19,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:19,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:19,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,629 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:19,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,637 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:19,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:19,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:19,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:19,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:19,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:19,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:19,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:19,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,705 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:19,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,712 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:19,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:19,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:19,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:19,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:19,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:19,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [135855463] [2024-11-10 05:01:19,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [135855463] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:19,756 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:19,756 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-10 05:01:19,756 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709612443] [2024-11-10 05:01:19,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:19,757 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-10 05:01:19,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:19,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-10 05:01:19,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-10 05:01:19,758 INFO L87 Difference]: Start difference. First operand 2133 states and 3053 transitions. Second operand has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:20,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:20,692 INFO L93 Difference]: Finished difference Result 4187 states and 5874 transitions. [2024-11-10 05:01:20,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-10 05:01:20,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-10 05:01:20,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:20,712 INFO L225 Difference]: With dead ends: 4187 [2024-11-10 05:01:20,712 INFO L226 Difference]: Without dead ends: 2487 [2024-11-10 05:01:20,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2024-11-10 05:01:20,722 INFO L432 NwaCegarLoop]: 191 mSDtfsCounter, 319 mSDsluCounter, 758 mSDsCounter, 0 mSdLazyCounter, 537 mSolverCounterSat, 91 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 949 SdHoareTripleChecker+Invalid, 628 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 91 IncrementalHoareTripleChecker+Valid, 537 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:20,722 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [319 Valid, 949 Invalid, 628 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [91 Valid, 537 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 05:01:20,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2487 states. [2024-11-10 05:01:20,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2487 to 2084. [2024-11-10 05:01:20,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2084 states, 1601 states have (on average 1.3322923173016865) internal successors, (2133), 1631 states have internal predecessors, (2133), 422 states have call successors, (422), 60 states have call predecessors, (422), 60 states have return successors, (422), 392 states have call predecessors, (422), 422 states have call successors, (422) [2024-11-10 05:01:20,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2084 states to 2084 states and 2977 transitions. [2024-11-10 05:01:20,900 INFO L78 Accepts]: Start accepts. Automaton has 2084 states and 2977 transitions. Word has length 190 [2024-11-10 05:01:20,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:20,901 INFO L471 AbstractCegarLoop]: Abstraction has 2084 states and 2977 transitions. [2024-11-10 05:01:20,901 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.888888888888889) internal successors, (53), 9 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:20,901 INFO L276 IsEmpty]: Start isEmpty. Operand 2084 states and 2977 transitions. [2024-11-10 05:01:20,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 05:01:20,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:20,905 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:20,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 05:01:20,905 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:20,905 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:20,906 INFO L85 PathProgramCache]: Analyzing trace with hash -122782861, now seen corresponding path program 1 times [2024-11-10 05:01:20,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:20,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884727135] [2024-11-10 05:01:20,906 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:20,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:20,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,335 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2024-11-10 05:01:21,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,339 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-10 05:01:21,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2024-11-10 05:01:21,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2024-11-10 05:01:21,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2024-11-10 05:01:21,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,348 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-10 05:01:21,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-10 05:01:21,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-10 05:01:21,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-10 05:01:21,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-10 05:01:21,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-10 05:01:21,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-10 05:01:21,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-10 05:01:21,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-10 05:01:21,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 82 [2024-11-10 05:01:21,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-10 05:01:21,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-10 05:01:21,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-10 05:01:21,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,381 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-10 05:01:21,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,386 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-10 05:01:21,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-10 05:01:21,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-10 05:01:21,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-10 05:01:21,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,409 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-10 05:01:21,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-10 05:01:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-10 05:01:21,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,427 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-10 05:01:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-10 05:01:21,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:21,440 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:21,440 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 05:01:21,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884727135] [2024-11-10 05:01:21,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884727135] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:21,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:21,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-10 05:01:21,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428585950] [2024-11-10 05:01:21,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:21,441 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 05:01:21,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 05:01:21,442 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 05:01:21,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-10 05:01:21,442 INFO L87 Difference]: Start difference. First operand 2084 states and 2977 transitions. Second operand has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:01:22,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:22,400 INFO L93 Difference]: Finished difference Result 6010 states and 8581 transitions. [2024-11-10 05:01:22,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-10 05:01:22,401 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 191 [2024-11-10 05:01:22,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:22,425 INFO L225 Difference]: With dead ends: 6010 [2024-11-10 05:01:22,425 INFO L226 Difference]: Without dead ends: 4366 [2024-11-10 05:01:22,433 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2024-11-10 05:01:22,434 INFO L432 NwaCegarLoop]: 239 mSDtfsCounter, 386 mSDsluCounter, 639 mSDsCounter, 0 mSdLazyCounter, 490 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 386 SdHoareTripleChecker+Valid, 878 SdHoareTripleChecker+Invalid, 609 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 490 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:22,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [386 Valid, 878 Invalid, 609 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 490 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-10 05:01:22,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4366 states. [2024-11-10 05:01:22,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4366 to 4312. [2024-11-10 05:01:22,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4312 states, 3353 states have (on average 1.334327467939159) internal successors, (4474), 3413 states have internal predecessors, (4474), 834 states have call successors, (834), 124 states have call predecessors, (834), 124 states have return successors, (834), 774 states have call predecessors, (834), 834 states have call successors, (834) [2024-11-10 05:01:22,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4312 states to 4312 states and 6142 transitions. [2024-11-10 05:01:22,780 INFO L78 Accepts]: Start accepts. Automaton has 4312 states and 6142 transitions. Word has length 191 [2024-11-10 05:01:22,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:22,781 INFO L471 AbstractCegarLoop]: Abstraction has 4312 states and 6142 transitions. [2024-11-10 05:01:22,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.714285714285714) internal successors, (54), 7 states have internal predecessors, (54), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:01:22,781 INFO L276 IsEmpty]: Start isEmpty. Operand 4312 states and 6142 transitions. [2024-11-10 05:01:22,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-10 05:01:22,786 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:22,786 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:22,786 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-10 05:01:22,787 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:22,787 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:22,787 INFO L85 PathProgramCache]: Analyzing trace with hash 2094975092, now seen corresponding path program 1 times [2024-11-10 05:01:22,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 05:01:22,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [235161662] [2024-11-10 05:01:22,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:22,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 05:01:22,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-10 05:01:22,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [606856870] [2024-11-10 05:01:22,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:22,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 05:01:22,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:01:22,863 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 05:01:22,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 05:01:22,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:01:22,993 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-10 05:01:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-10 05:01:23,215 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-10 05:01:23,216 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-10 05:01:23,218 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-10 05:01:23,239 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:01:23,423 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,SelfDestructingSolverStorable8 [2024-11-10 05:01:23,427 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:23,561 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-10 05:01:23,564 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 05:01:23 BoogieIcfgContainer [2024-11-10 05:01:23,565 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-10 05:01:23,565 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-10 05:01:23,565 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-10 05:01:23,565 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-10 05:01:23,566 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:01:03" (3/4) ... [2024-11-10 05:01:23,568 INFO L146 WitnessPrinter]: No result that supports witness generation found [2024-11-10 05:01:23,569 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-10 05:01:23,570 INFO L158 Benchmark]: Toolchain (without parser) took 21503.27ms. Allocated memory was 157.3MB in the beginning and 463.5MB in the end (delta: 306.2MB). Free memory was 103.5MB in the beginning and 283.3MB in the end (delta: -179.8MB). Peak memory consumption was 126.3MB. Max. memory is 16.1GB. [2024-11-10 05:01:23,570 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 60.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-10 05:01:23,570 INFO L158 Benchmark]: CACSL2BoogieTranslator took 418.99ms. Allocated memory is still 157.3MB. Free memory was 103.0MB in the beginning and 86.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-10 05:01:23,571 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.27ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 125.7MB in the end (delta: -39.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2024-11-10 05:01:23,571 INFO L158 Benchmark]: Boogie Preprocessor took 99.40ms. Allocated memory is still 157.3MB. Free memory was 125.7MB in the beginning and 119.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-10 05:01:23,571 INFO L158 Benchmark]: IcfgBuilder took 727.70ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 87.1MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. [2024-11-10 05:01:23,571 INFO L158 Benchmark]: TraceAbstraction took 20162.58ms. Allocated memory was 157.3MB in the beginning and 463.5MB in the end (delta: 306.2MB). Free memory was 86.7MB in the beginning and 284.3MB in the end (delta: -197.6MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. [2024-11-10 05:01:23,572 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 463.5MB. Free memory was 284.3MB in the beginning and 283.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-10 05:01:23,573 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.16ms. Allocated memory is still 96.5MB. Free memory was 61.0MB in the beginning and 60.9MB in the end (delta: 70.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 418.99ms. Allocated memory is still 157.3MB. Free memory was 103.0MB in the beginning and 86.1MB in the end (delta: 16.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.27ms. Allocated memory is still 157.3MB. Free memory was 86.1MB in the beginning and 125.7MB in the end (delta: -39.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 99.40ms. Allocated memory is still 157.3MB. Free memory was 125.7MB in the beginning and 119.4MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * IcfgBuilder took 727.70ms. Allocated memory is still 157.3MB. Free memory was 119.4MB in the beginning and 87.1MB in the end (delta: 32.3MB). Peak memory consumption was 31.5MB. Max. memory is 16.1GB. * TraceAbstraction took 20162.58ms. Allocated memory was 157.3MB in the beginning and 463.5MB in the end (delta: 306.2MB). Free memory was 86.7MB in the beginning and 284.3MB in the end (delta: -197.6MB). Peak memory consumption was 110.7MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 463.5MB. Free memory was 284.3MB in the beginning and 283.3MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 190, overapproximation of shiftRight at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned short int var_1_28 = 16; [L42] signed short int var_1_30 = -256; [L43] signed short int var_1_32 = 8; [L44] unsigned short int var_1_33 = 128; [L45] double var_1_34 = 0.25; [L46] signed long int var_1_36 = -32; [L47] unsigned char var_1_38 = 0; [L48] unsigned char var_1_39 = 1; [L49] float var_1_40 = 2.6; [L50] unsigned char var_1_41 = 0; [L51] unsigned char var_1_42 = 0; [L52] unsigned short int last_1_var_1_1 = 100; [L53] unsigned long int last_1_var_1_12 = 8; [L54] double last_1_var_1_13 = 8.25; [L55] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_12 = var_1_12 [L186] last_1_var_1_13 = var_1_13 [L187] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L140] var_1_6 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [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_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_8=10, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=10, var_1_9=0] [L146] var_1_8 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L148] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L149] var_1_9 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535] [L150] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535] [L151] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L151] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L153] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L156] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L157] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L157] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L158] var_1_14 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L159] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L160] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L160] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L161] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L161] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L162] var_1_15 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L163] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L164] var_1_18 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L166] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L166] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L167] var_1_19 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L168] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L169] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L169] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L170] var_1_21 = __VERIFIER_nondet_long() [L171] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L171] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L172] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L172] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L174] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L175] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L175] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L176] var_1_39 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L177] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L178] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L178] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L179] var_1_42 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L180] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L181] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L181] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L198] RET updateVariables() [L199] CALL step() [L59] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=1, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L60] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L71] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L73] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L73] COND FALSE !((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) [L78] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L79] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L80] COND FALSE !(\read(var_1_6)) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L83] COND FALSE !((~ var_1_19) == stepLocal_4) [L86] var_1_20 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L89] unsigned char stepLocal_3 = var_1_6; [L90] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=0, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L91] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L96] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L98] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32767, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=33/4, var_1_14=-1, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L99] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L100] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=4, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L104] COND TRUE (var_1_20 + var_1_20) > 16 [L105] var_1_23 = ((var_1_26 + 2) + var_1_18) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L113] var_1_28 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L114] COND TRUE var_1_16 < 2 [L115] var_1_30 = (((((((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) > (var_1_12)) ? (((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) : (var_1_12))) + var_1_19) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L119] EXPR var_1_11 | var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L119] COND FALSE !((~ (var_1_11 | var_1_20)) >= (~ (~ 32))) [L122] EXPR var_1_19 >> var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L122] COND FALSE !((var_1_19 >> var_1_18) <= var_1_18) [L127] COND FALSE !(var_1_12 >= var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L132] COND FALSE !(((var_1_8 - var_1_19) > var_1_8) && var_1_6) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L135] var_1_38 = var_1_39 [L136] var_1_40 = var_1_15 [L137] var_1_41 = var_1_42 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=0, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L190] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L190-L191] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=32767, var_1_12=8, var_1_13=2, var_1_14=-1, var_1_15=2, var_1_16=1, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=32767, var_1_21=536870911, var_1_23=66, var_1_26=64, var_1_28=32767, var_1_30=127, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=1, var_1_8=-65535, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 103 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 20.0s, OverallIterations: 9, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 10.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2962 SdHoareTripleChecker+Valid, 5.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2941 mSDsluCounter, 6560 SdHoareTripleChecker+Invalid, 4.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4948 mSDsCounter, 1230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4377 IncrementalHoareTripleChecker+Invalid, 5607 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1230 mSolverCounterUnsat, 1612 mSDtfsCounter, 4377 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1094 GetRequests, 890 SyntacticMatches, 0 SemanticMatches, 204 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10761 ImplicationChecksByTransitivity, 5.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=4312occurred in iteration=8, InterpolantAutomatonStates: 189, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 8 MinimizatonAttempts, 1796 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 6.2s InterpolantComputationTime, 2072 NumberOfCodeBlocks, 2072 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 1869 ConstructedInterpolants, 0 QuantifiedInterpolants, 8854 SizeOfPredicates, 8 NumberOfNonLiveVariables, 448 ConjunctsInSsa, 11 ConjunctsInUnsatCore, 10 InterpolantComputations, 7 PerfectInterpolantSequences, 15057/15120 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-10 05:01:23,651 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.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 be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 05:01:25,957 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 05:01:26,036 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-10 05:01:26,041 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 05:01:26,041 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 05:01:26,072 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 05:01:26,073 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 05:01:26,073 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 05:01:26,073 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 05:01:26,074 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 05:01:26,075 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 05:01:26,076 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 05:01:26,077 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 05:01:26,079 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 05:01:26,079 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 05:01:26,080 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 05:01:26,080 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-10 05:01:26,080 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 05:01:26,081 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 05:01:26,081 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 05:01:26,084 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-10 05:01:26,085 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 05:01:26,085 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-10 05:01:26,085 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 05:01:26,086 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-10 05:01:26,086 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 05:01:26,086 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-10 05:01:26,086 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 05:01:26,087 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-10 05:01:26,087 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 05:01:26,087 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 05:01:26,087 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 05:01:26,088 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 05:01:26,088 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 05:01:26,088 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:01:26,089 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 05:01:26,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 05:01:26,090 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-10 05:01:26,090 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-10 05:01:26,091 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-10 05:01:26,091 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 05:01:26,092 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 05:01:26,092 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 05:01:26,092 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 05:01:26,093 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 -> be4e3b4159e813d651c15a1198ce093d0780697daead1a14334250f886e53033 [2024-11-10 05:01:26,421 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 05:01:26,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 05:01:26,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 05:01:26,444 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 05:01:26,444 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 05:01:26,445 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-10 05:01:28,021 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 05:01:28,255 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 05:01:28,256 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-10 05:01:28,267 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e92b9d26/c7f394ec45b5417386353dd8e543ef01/FLAGb04d493b3 [2024-11-10 05:01:28,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7e92b9d26/c7f394ec45b5417386353dd8e543ef01 [2024-11-10 05:01:28,291 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 05:01:28,293 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 05:01:28,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 05:01:28,295 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 05:01:28,301 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 05:01:28,302 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,303 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@668ae80c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28, skipping insertion in model container [2024-11-10 05:01:28,303 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,337 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 05:01:28,538 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i[919,932] [2024-11-10 05:01:28,629 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:01:28,650 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 05:01:28,665 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i[919,932] [2024-11-10 05:01:28,741 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 05:01:28,774 INFO L204 MainTranslator]: Completed translation [2024-11-10 05:01:28,775 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28 WrapperNode [2024-11-10 05:01:28,775 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 05:01:28,776 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 05:01:28,777 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 05:01:28,777 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 05:01:28,783 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,798 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,837 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 191 [2024-11-10 05:01:28,841 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 05:01:28,842 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 05:01:28,842 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 05:01:28,842 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 05:01:28,852 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,853 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,859 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,873 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-10 05:01:28,873 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,873 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,883 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,888 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,892 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 05:01:28,893 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 05:01:28,893 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 05:01:28,893 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 05:01:28,894 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (1/1) ... [2024-11-10 05:01:28,906 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 05:01:28,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 05:01:28,943 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 05:01:28,945 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 05:01:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-10 05:01:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-10 05:01:28,979 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-10 05:01:28,979 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-10 05:01:28,980 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 05:01:28,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 05:01:29,087 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 05:01:29,091 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 05:01:29,744 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-10 05:01:29,748 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 05:01:29,772 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 05:01:29,772 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 05:01:29,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:01:29 BoogieIcfgContainer [2024-11-10 05:01:29,773 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 05:01:29,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 05:01:29,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 05:01:29,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 05:01:29,779 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 05:01:28" (1/3) ... [2024-11-10 05:01:29,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79da6b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:01:29, skipping insertion in model container [2024-11-10 05:01:29,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 05:01:28" (2/3) ... [2024-11-10 05:01:29,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79da6b6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 05:01:29, skipping insertion in model container [2024-11-10 05:01:29,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 05:01:29" (3/3) ... [2024-11-10 05:01:29,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-pe-ci_file-92.i [2024-11-10 05:01:29,800 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 05:01:29,801 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-10 05:01:29,863 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 05:01:29,868 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;@4b7e789, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 05:01:29,869 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-10 05:01:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:01:29,885 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 05:01:29,885 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:29,886 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:29,886 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:29,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:29,890 INFO L85 PathProgramCache]: Analyzing trace with hash 487258892, now seen corresponding path program 1 times [2024-11-10 05:01:29,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:01:29,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074482738] [2024-11-10 05:01:29,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:29,903 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:01:29,903 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:01:29,906 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:01:29,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-10 05:01:30,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:30,182 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-10 05:01:30,195 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:01:30,254 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 494 proven. 0 refuted. 0 times theorem prover too weak. 1018 trivial. 0 not checked. [2024-11-10 05:01:30,256 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:01:30,257 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:01:30,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074482738] [2024-11-10 05:01:30,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074482738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:30,258 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:30,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 05:01:30,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [706050885] [2024-11-10 05:01:30,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:30,267 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-10 05:01:30,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:01:30,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-10 05:01:30,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:01:30,296 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.4210526315789473) internal successors, (81), 58 states have internal predecessors, (81), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:01:30,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:30,339 INFO L93 Difference]: Finished difference Result 168 states and 295 transitions. [2024-11-10 05:01:30,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-10 05:01:30,341 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 181 [2024-11-10 05:01:30,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:30,352 INFO L225 Difference]: With dead ends: 168 [2024-11-10 05:01:30,352 INFO L226 Difference]: Without dead ends: 83 [2024-11-10 05:01:30,357 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 180 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-10 05:01:30,362 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:30,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 05:01:30,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-10 05:01:30,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-10 05:01:30,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 53 states have (on average 1.3584905660377358) internal successors, (72), 53 states have internal predecessors, (72), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-10 05:01:30,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 128 transitions. [2024-11-10 05:01:30,442 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 128 transitions. Word has length 181 [2024-11-10 05:01:30,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:30,443 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 128 transitions. [2024-11-10 05:01:30,443 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 24.0) internal successors, (48), 2 states have internal predecessors, (48), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-10 05:01:30,443 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 128 transitions. [2024-11-10 05:01:30,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-10 05:01:30,450 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:30,451 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:30,463 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-10 05:01:30,653 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:01:30,654 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:30,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:30,655 INFO L85 PathProgramCache]: Analyzing trace with hash -1288312018, now seen corresponding path program 1 times [2024-11-10 05:01:30,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:01:30,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1384884269] [2024-11-10 05:01:30,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:30,657 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:01:30,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:01:30,659 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:01:30,660 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-10 05:01:30,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:30,920 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-10 05:01:30,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:01:31,483 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-10 05:01:31,483 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-10 05:01:31,483 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:01:31,484 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1384884269] [2024-11-10 05:01:31,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1384884269] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 05:01:31,484 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 05:01:31,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 05:01:31,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195150726] [2024-11-10 05:01:31,487 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 05:01:31,489 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 05:01:31,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:01:31,490 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 05:01:31,490 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 05:01:31,492 INFO L87 Difference]: Start difference. First operand 83 states and 128 transitions. Second operand has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:32,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:32,601 INFO L93 Difference]: Finished difference Result 265 states and 409 transitions. [2024-11-10 05:01:32,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 05:01:32,603 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 181 [2024-11-10 05:01:32,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:32,607 INFO L225 Difference]: With dead ends: 265 [2024-11-10 05:01:32,609 INFO L226 Difference]: Without dead ends: 185 [2024-11-10 05:01:32,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 05:01:32,614 INFO L432 NwaCegarLoop]: 149 mSDtfsCounter, 115 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:32,614 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 387 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 05:01:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-11-10 05:01:32,660 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 160. [2024-11-10 05:01:32,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 101 states have (on average 1.3564356435643565) internal successors, (137), 101 states have internal predecessors, (137), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-10 05:01:32,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 249 transitions. [2024-11-10 05:01:32,666 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 249 transitions. Word has length 181 [2024-11-10 05:01:32,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:32,668 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 249 transitions. [2024-11-10 05:01:32,669 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 11.0) internal successors, (44), 3 states have internal predecessors, (44), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-10 05:01:32,669 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 249 transitions. [2024-11-10 05:01:32,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 183 [2024-11-10 05:01:32,672 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:32,673 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:32,685 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-10 05:01:32,873 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:01:32,874 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:32,875 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:32,875 INFO L85 PathProgramCache]: Analyzing trace with hash 1792208311, now seen corresponding path program 1 times [2024-11-10 05:01:32,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:01:32,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [67832555] [2024-11-10 05:01:32,876 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:32,877 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:01:32,877 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:01:32,878 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:01:32,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-10 05:01:33,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:33,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-10 05:01:33,126 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:01:33,934 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 1023 proven. 78 refuted. 0 times theorem prover too weak. 411 trivial. 0 not checked. [2024-11-10 05:01:33,934 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:01:34,345 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-10 05:01:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [67832555] [2024-11-10 05:01:34,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [67832555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:01:34,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1056504286] [2024-11-10 05:01:34,348 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:34,348 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-10 05:01:34,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-10 05:01:34,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-10 05:01:34,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-10 05:01:34,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:34,906 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-10 05:01:34,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 05:01:35,390 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 636 proven. 36 refuted. 0 times theorem prover too weak. 840 trivial. 0 not checked. [2024-11-10 05:01:35,390 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 05:01:36,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1056504286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 05:01:36,288 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-10 05:01:36,289 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 17 [2024-11-10 05:01:36,289 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783010367] [2024-11-10 05:01:36,289 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-10 05:01:36,290 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-10 05:01:36,290 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-10 05:01:36,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-10 05:01:36,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-10 05:01:36,292 INFO L87 Difference]: Start difference. First operand 160 states and 249 transitions. Second operand has 17 states, 17 states have (on average 5.0) internal successors, (85), 15 states have internal predecessors, (85), 6 states have call successors, (44), 6 states have call predecessors, (44), 8 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-10 05:01:41,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0] [2024-11-10 05:01:41,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 05:01:41,364 INFO L93 Difference]: Finished difference Result 397 states and 589 transitions. [2024-11-10 05:01:41,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-10 05:01:41,365 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 15 states have internal predecessors, (85), 6 states have call successors, (44), 6 states have call predecessors, (44), 8 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) Word has length 182 [2024-11-10 05:01:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 05:01:41,368 INFO L225 Difference]: With dead ends: 397 [2024-11-10 05:01:41,370 INFO L226 Difference]: Without dead ends: 240 [2024-11-10 05:01:41,372 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 422 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 198 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=233, Invalid=697, Unknown=0, NotChecked=0, Total=930 [2024-11-10 05:01:41,374 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 231 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 660 mSolverCounterSat, 71 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 529 SdHoareTripleChecker+Invalid, 731 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 71 IncrementalHoareTripleChecker+Valid, 660 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.7s IncrementalHoareTripleChecker+Time [2024-11-10 05:01:41,376 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [251 Valid, 529 Invalid, 731 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [71 Valid, 660 Invalid, 0 Unknown, 0 Unchecked, 4.7s Time] [2024-11-10 05:01:41,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-10 05:01:41,417 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 224. [2024-11-10 05:01:41,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 224 states, 148 states have (on average 1.2905405405405406) internal successors, (191), 149 states have internal predecessors, (191), 66 states have call successors, (66), 9 states have call predecessors, (66), 9 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-10 05:01:41,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 224 states to 224 states and 323 transitions. [2024-11-10 05:01:41,420 INFO L78 Accepts]: Start accepts. Automaton has 224 states and 323 transitions. Word has length 182 [2024-11-10 05:01:41,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 05:01:41,421 INFO L471 AbstractCegarLoop]: Abstraction has 224 states and 323 transitions. [2024-11-10 05:01:41,421 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.0) internal successors, (85), 15 states have internal predecessors, (85), 6 states have call successors, (44), 6 states have call predecessors, (44), 8 states have return successors, (45), 6 states have call predecessors, (45), 6 states have call successors, (45) [2024-11-10 05:01:41,421 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 323 transitions. [2024-11-10 05:01:41,423 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 184 [2024-11-10 05:01:41,423 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 05:01:41,424 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 05:01:41,435 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Ended with exit code 0 [2024-11-10 05:01:41,631 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Forceful destruction successful, exit code 0 [2024-11-10 05:01:41,824 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,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-10 05:01:41,825 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-10 05:01:41,826 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 05:01:41,826 INFO L85 PathProgramCache]: Analyzing trace with hash -363317968, now seen corresponding path program 1 times [2024-11-10 05:01:41,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-10 05:01:41,827 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83514359] [2024-11-10 05:01:41,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 05:01:41,827 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-10 05:01:41,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-10 05:01:41,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-10 05:01:41,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-10 05:01:42,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 05:01:42,090 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-10 05:01:42,102 INFO L278 TraceCheckSpWp]: Computing forward predicates...