./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:12:05,713 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:12:05,758 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-20 03:12:05,762 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:12:05,762 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:12:05,789 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:12:05,790 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:12:05,790 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:12:05,791 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:12:05,791 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:12:05,792 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:12:05,792 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:12:05,792 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:12:05,794 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:12:05,794 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:12:05,795 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:12:05,795 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:12:05,795 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:12:05,795 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 03:12:05,795 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:12:05,796 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:12:05,799 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:12:05,799 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:12:05,799 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:12:05,799 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:12:05,800 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:12:05,800 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:12:05,800 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:12:05,800 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:12:05,800 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:12:05,801 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:12:05,801 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:12:05,801 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:12:05,801 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:12:05,801 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:12:05,801 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:12:05,802 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 03:12:05,802 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 03:12:05,802 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:12:05,802 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:12:05,802 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:12:05,803 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:12:05,803 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-11-20 03:12:06,032 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:12:06,063 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:12:06,065 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:12:06,066 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:12:06,066 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:12:06,067 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-20 03:12:07,719 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:12:07,919 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:12:07,920 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-20 03:12:07,929 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd76f3c5c/96b7bb221ac54d959617c950c3d59faf/FLAG5c48649da [2024-11-20 03:12:08,292 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd76f3c5c/96b7bb221ac54d959617c950c3d59faf [2024-11-20 03:12:08,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:12:08,295 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:12:08,297 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:12:08,297 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:12:08,302 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:12:08,303 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,304 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@55d3ce4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08, skipping insertion in model container [2024-11-20 03:12:08,304 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,327 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:12:08,465 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-20 03:12:08,516 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:12:08,526 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:12:08,535 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-20 03:12:08,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:12:08,622 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:12:08,622 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08 WrapperNode [2024-11-20 03:12:08,623 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:12:08,623 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:12:08,624 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:12:08,624 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:12:08,633 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,643 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,683 INFO L138 Inliner]: procedures = 26, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 190 [2024-11-20 03:12:08,687 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:12:08,688 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:12:08,688 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:12:08,688 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:12:08,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,708 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,738 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-20 03:12:08,738 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,739 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,759 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,762 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,772 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,778 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,784 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:12:08,792 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:12:08,792 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:12:08,792 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:12:08,793 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (1/1) ... [2024-11-20 03:12:08,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:12:08,823 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:12:08,863 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-20 03:12:08,869 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-20 03:12:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:12:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:12:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:12:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-20 03:12:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:12:08,909 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:12:08,986 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:12:08,991 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:12:09,436 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 03:12:09,437 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:12:09,452 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:12:09,455 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:12:09,456 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:09 BoogieIcfgContainer [2024-11-20 03:12:09,456 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:12:09,457 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:12:09,457 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:12:09,460 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:12:09,460 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:12:08" (1/3) ... [2024-11-20 03:12:09,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f22220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:12:09, skipping insertion in model container [2024-11-20 03:12:09,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:08" (2/3) ... [2024-11-20 03:12:09,461 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6f22220 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:12:09, skipping insertion in model container [2024-11-20 03:12:09,461 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:09" (3/3) ... [2024-11-20 03:12:09,462 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-20 03:12:09,475 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:12:09,475 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:12:09,522 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:12:09,527 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;@1bf21706, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:12:09,527 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:12:09,535 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 03:12:09,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 03:12:09,547 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:09,548 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:09,548 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:09,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:09,553 INFO L85 PathProgramCache]: Analyzing trace with hash -1783273033, now seen corresponding path program 1 times [2024-11-20 03:12:09,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:09,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1784501188] [2024-11-20 03:12:09,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:09,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:09,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:09,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:09,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:09,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:09,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,901 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:09,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:09,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:09,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,933 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:09,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,941 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:09,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,949 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:09,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:09,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:09,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,965 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:09,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,974 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:09,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,977 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,981 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:09,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:09,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:09,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:09,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:10,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:10,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:10,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,022 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:10,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:10,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:10,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:10,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:10,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,043 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:10,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:10,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:12:10,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:10,050 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1784501188] [2024-11-20 03:12:10,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1784501188] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:12:10,055 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:12:10,055 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:12:10,056 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491065165] [2024-11-20 03:12:10,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:12:10,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:12:10,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:10,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:12:10,086 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:12:10,088 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 03:12:10,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:10,121 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2024-11-20 03:12:10,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:12:10,123 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2024-11-20 03:12:10,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:10,129 INFO L225 Difference]: With dead ends: 155 [2024-11-20 03:12:10,130 INFO L226 Difference]: Without dead ends: 77 [2024-11-20 03:12:10,133 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 92 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-20 03:12:10,137 INFO L432 NwaCegarLoop]: 117 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, 117 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-20 03:12:10,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:12:10,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-20 03:12:10,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-20 03:12:10,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 03:12:10,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-20 03:12:10,178 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 186 [2024-11-20 03:12:10,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:10,179 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-20 03:12:10,179 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 19.5) internal successors, (39), 2 states have internal predecessors, (39), 2 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 03:12:10,180 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-20 03:12:10,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 03:12:10,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:10,184 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:10,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 03:12:10,185 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:10,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:10,185 INFO L85 PathProgramCache]: Analyzing trace with hash -579856256, now seen corresponding path program 1 times [2024-11-20 03:12:10,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:10,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962033592] [2024-11-20 03:12:10,186 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:10,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:10,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:11,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:11,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:11,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:11,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,115 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:11,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:11,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:11,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:11,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:11,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:11,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,137 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:11,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,140 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:11,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,142 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:11,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,144 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:11,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,145 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:11,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,151 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:11,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,153 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:11,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:11,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:11,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,164 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:11,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:11,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,168 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:11,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,171 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:11,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:11,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:11,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:11,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,181 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:11,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:11,184 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:12:11,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:11,188 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962033592] [2024-11-20 03:12:11,188 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [962033592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:12:11,188 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:12:11,188 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 03:12:11,189 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411951828] [2024-11-20 03:12:11,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:12:11,190 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:12:11,190 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:11,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:12:11,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:12:11,191 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:11,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:11,292 INFO L93 Difference]: Finished difference Result 179 states and 266 transitions. [2024-11-20 03:12:11,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:12:11,293 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-11-20 03:12:11,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:11,295 INFO L225 Difference]: With dead ends: 179 [2024-11-20 03:12:11,297 INFO L226 Difference]: Without dead ends: 105 [2024-11-20 03:12:11,298 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:12:11,299 INFO L432 NwaCegarLoop]: 110 mSDtfsCounter, 38 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:11,301 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 305 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 03:12:11,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-20 03:12:11,308 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 87. [2024-11-20 03:12:11,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 55 states have (on average 1.309090909090909) internal successors, (72), 55 states have internal predecessors, (72), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 03:12:11,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 132 transitions. [2024-11-20 03:12:11,310 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 132 transitions. Word has length 187 [2024-11-20 03:12:11,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:11,312 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 132 transitions. [2024-11-20 03:12:11,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:11,312 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 132 transitions. [2024-11-20 03:12:11,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 03:12:11,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:11,314 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:11,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 03:12:11,315 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:11,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:11,315 INFO L85 PathProgramCache]: Analyzing trace with hash -578009214, now seen corresponding path program 1 times [2024-11-20 03:12:11,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:11,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666695355] [2024-11-20 03:12:11,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:11,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:11,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:15,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:15,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:15,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:15,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:15,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:15,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:15,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:15,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,222 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:15,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:15,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,233 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:15,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,239 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:15,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:15,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:15,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:15,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,256 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:15,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:15,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,264 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:15,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:15,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:15,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:15,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:15,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:15,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,292 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:15,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,294 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:15,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,296 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:15,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:15,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:15,301 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:12:15,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:15,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666695355] [2024-11-20 03:12:15,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666695355] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:12:15,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:12:15,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 03:12:15,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758080707] [2024-11-20 03:12:15,303 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:12:15,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 03:12:15,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:15,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 03:12:15,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-20 03:12:15,306 INFO L87 Difference]: Start difference. First operand 87 states and 132 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:16,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:16,190 INFO L93 Difference]: Finished difference Result 245 states and 359 transitions. [2024-11-20 03:12:16,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 03:12:16,193 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-11-20 03:12:16,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:16,198 INFO L225 Difference]: With dead ends: 245 [2024-11-20 03:12:16,199 INFO L226 Difference]: Without dead ends: 161 [2024-11-20 03:12:16,200 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2024-11-20 03:12:16,202 INFO L432 NwaCegarLoop]: 103 mSDtfsCounter, 99 mSDsluCounter, 482 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 585 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:16,202 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 585 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 03:12:16,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2024-11-20 03:12:16,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 126. [2024-11-20 03:12:16,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 91 states have (on average 1.2967032967032968) internal successors, (118), 92 states have internal predecessors, (118), 32 states have call successors, (32), 2 states have call predecessors, (32), 2 states have return successors, (32), 31 states have call predecessors, (32), 32 states have call successors, (32) [2024-11-20 03:12:16,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 182 transitions. [2024-11-20 03:12:16,227 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 182 transitions. Word has length 187 [2024-11-20 03:12:16,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:16,232 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 182 transitions. [2024-11-20 03:12:16,232 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 9 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:16,232 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 182 transitions. [2024-11-20 03:12:16,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 03:12:16,235 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:16,235 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:16,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 03:12:16,235 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:16,235 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:16,236 INFO L85 PathProgramCache]: Analyzing trace with hash -319843776, now seen corresponding path program 1 times [2024-11-20 03:12:16,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:16,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029951042] [2024-11-20 03:12:16,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:16,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:16,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:16,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,606 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:16,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:16,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:16,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:16,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:16,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:16,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:16,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:16,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:16,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:16,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,646 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:16,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:16,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:16,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:16,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:16,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:16,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:16,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:16,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:16,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:16,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:16,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,684 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:16,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:16,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:16,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:16,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,700 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:16,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:16,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:16,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:12:16,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:16,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029951042] [2024-11-20 03:12:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029951042] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:12:16,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:12:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:12:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423748876] [2024-11-20 03:12:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:12:16,711 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 03:12:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 03:12:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:12:16,712 INFO L87 Difference]: Start difference. First operand 126 states and 182 transitions. Second operand has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:16,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:16,817 INFO L93 Difference]: Finished difference Result 346 states and 506 transitions. [2024-11-20 03:12:16,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:12:16,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 187 [2024-11-20 03:12:16,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:16,825 INFO L225 Difference]: With dead ends: 346 [2024-11-20 03:12:16,825 INFO L226 Difference]: Without dead ends: 223 [2024-11-20 03:12:16,825 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:12:16,826 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 58 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:16,829 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 230 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 03:12:16,829 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2024-11-20 03:12:16,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 221. [2024-11-20 03:12:16,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 221 states, 152 states have (on average 1.2894736842105263) internal successors, (196), 154 states have internal predecessors, (196), 64 states have call successors, (64), 4 states have call predecessors, (64), 4 states have return successors, (64), 62 states have call predecessors, (64), 64 states have call successors, (64) [2024-11-20 03:12:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 221 states to 221 states and 324 transitions. [2024-11-20 03:12:16,853 INFO L78 Accepts]: Start accepts. Automaton has 221 states and 324 transitions. Word has length 187 [2024-11-20 03:12:16,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:16,853 INFO L471 AbstractCegarLoop]: Abstraction has 221 states and 324 transitions. [2024-11-20 03:12:16,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.333333333333334) internal successors, (40), 3 states have internal predecessors, (40), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:16,854 INFO L276 IsEmpty]: Start isEmpty. Operand 221 states and 324 transitions. [2024-11-20 03:12:16,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:12:16,855 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:16,855 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:16,856 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 03:12:16,856 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:16,856 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:16,856 INFO L85 PathProgramCache]: Analyzing trace with hash 407642383, now seen corresponding path program 1 times [2024-11-20 03:12:16,856 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:16,856 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305079913] [2024-11-20 03:12:16,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:16,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:16,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,980 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:16,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:16,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,983 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:16,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:16,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:16,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:16,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,988 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:16,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,989 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:16,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,992 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,993 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:16,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:16,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,996 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:16,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,997 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:16,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,998 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:16,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:16,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:17,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:17,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:17,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,003 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:17,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:17,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,005 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:17,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:17,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,007 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:17,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,008 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:17,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:17,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:17,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,012 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:17,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,013 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:17,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:17,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,015 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:17,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,017 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:12:17,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:17,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305079913] [2024-11-20 03:12:17,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305079913] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:12:17,017 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:12:17,017 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:12:17,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119623665] [2024-11-20 03:12:17,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:12:17,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 03:12:17,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:17,019 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 03:12:17,019 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 03:12:17,019 INFO L87 Difference]: Start difference. First operand 221 states and 324 transitions. Second operand has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:17,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:17,213 INFO L93 Difference]: Finished difference Result 436 states and 637 transitions. [2024-11-20 03:12:17,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 03:12:17,214 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-20 03:12:17,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:17,216 INFO L225 Difference]: With dead ends: 436 [2024-11-20 03:12:17,216 INFO L226 Difference]: Without dead ends: 313 [2024-11-20 03:12:17,217 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 62 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-20 03:12:17,220 INFO L432 NwaCegarLoop]: 202 mSDtfsCounter, 123 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 123 SdHoareTripleChecker+Valid, 434 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:17,221 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [123 Valid, 434 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-20 03:12:17,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 313 states. [2024-11-20 03:12:17,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 313 to 306. [2024-11-20 03:12:17,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 306 states, 203 states have (on average 1.2561576354679802) internal successors, (255), 206 states have internal predecessors, (255), 96 states have call successors, (96), 6 states have call predecessors, (96), 6 states have return successors, (96), 93 states have call predecessors, (96), 96 states have call successors, (96) [2024-11-20 03:12:17,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 306 states to 306 states and 447 transitions. [2024-11-20 03:12:17,269 INFO L78 Accepts]: Start accepts. Automaton has 306 states and 447 transitions. Word has length 188 [2024-11-20 03:12:17,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:17,270 INFO L471 AbstractCegarLoop]: Abstraction has 306 states and 447 transitions. [2024-11-20 03:12:17,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.25) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:17,271 INFO L276 IsEmpty]: Start isEmpty. Operand 306 states and 447 transitions. [2024-11-20 03:12:17,272 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:12:17,272 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:17,272 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:17,272 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 03:12:17,273 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:17,273 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:17,273 INFO L85 PathProgramCache]: Analyzing trace with hash 1087700753, now seen corresponding path program 1 times [2024-11-20 03:12:17,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:17,274 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806286665] [2024-11-20 03:12:17,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:17,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:17,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:17,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,750 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:17,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,753 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:17,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,755 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:17,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,758 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:17,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,760 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:17,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,762 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:17,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,765 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:17,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,768 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:17,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,793 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:17,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:17,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,803 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:17,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:17,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,810 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:17,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:17,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:17,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:17,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,827 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:17,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,830 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:17,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:17,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,838 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:17,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,842 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,845 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:17,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,848 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:17,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,851 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:17,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:17,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,863 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:17,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,867 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:17,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,872 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:17,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,875 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:17,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:17,880 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 24 proven. 63 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 03:12:17,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:17,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806286665] [2024-11-20 03:12:17,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806286665] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:12:17,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369914620] [2024-11-20 03:12:17,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:17,881 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:12:17,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:12:17,883 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-20 03:12:17,887 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-20 03:12:18,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:18,041 INFO L255 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-20 03:12:18,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:12:20,935 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 801 proven. 276 refuted. 0 times theorem prover too weak. 663 trivial. 0 not checked. [2024-11-20 03:12:20,935 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:12:42,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369914620] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:12:42,327 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 03:12:42,327 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 19] total 26 [2024-11-20 03:12:42,327 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876976056] [2024-11-20 03:12:42,327 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 03:12:42,328 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 03:12:42,328 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:42,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 03:12:42,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=400, Invalid=1159, Unknown=1, NotChecked=0, Total=1560 [2024-11-20 03:12:42,330 INFO L87 Difference]: Start difference. First operand 306 states and 447 transitions. Second operand has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 24 states have internal predecessors, (95), 8 states have call successors, (60), 7 states have call predecessors, (60), 10 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-11-20 03:12:47,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:47,622 INFO L93 Difference]: Finished difference Result 1093 states and 1527 transitions. [2024-11-20 03:12:47,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 88 states. [2024-11-20 03:12:47,626 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 24 states have internal predecessors, (95), 8 states have call successors, (60), 7 states have call predecessors, (60), 10 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) Word has length 188 [2024-11-20 03:12:47,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:47,631 INFO L225 Difference]: With dead ends: 1093 [2024-11-20 03:12:47,631 INFO L226 Difference]: Without dead ends: 885 [2024-11-20 03:12:47,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 511 GetRequests, 391 SyntacticMatches, 0 SemanticMatches, 120 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4709 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=3166, Invalid=11595, Unknown=1, NotChecked=0, Total=14762 [2024-11-20 03:12:47,636 INFO L432 NwaCegarLoop]: 129 mSDtfsCounter, 789 mSDsluCounter, 780 mSDsCounter, 0 mSdLazyCounter, 1606 mSolverCounterSat, 441 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 819 SdHoareTripleChecker+Valid, 909 SdHoareTripleChecker+Invalid, 2047 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 441 IncrementalHoareTripleChecker+Valid, 1606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:47,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [819 Valid, 909 Invalid, 2047 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [441 Valid, 1606 Invalid, 0 Unknown, 0 Unchecked, 2.2s Time] [2024-11-20 03:12:47,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 885 states. [2024-11-20 03:12:47,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 885 to 782. [2024-11-20 03:12:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 511 states have (on average 1.213307240704501) internal successors, (620), 521 states have internal predecessors, (620), 236 states have call successors, (236), 34 states have call predecessors, (236), 34 states have return successors, (236), 226 states have call predecessors, (236), 236 states have call successors, (236) [2024-11-20 03:12:47,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1092 transitions. [2024-11-20 03:12:47,736 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1092 transitions. Word has length 188 [2024-11-20 03:12:47,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:47,739 INFO L471 AbstractCegarLoop]: Abstraction has 782 states and 1092 transitions. [2024-11-20 03:12:47,739 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6538461538461537) internal successors, (95), 24 states have internal predecessors, (95), 8 states have call successors, (60), 7 states have call predecessors, (60), 10 states have return successors, (60), 8 states have call predecessors, (60), 8 states have call successors, (60) [2024-11-20 03:12:47,739 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1092 transitions. [2024-11-20 03:12:47,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:12:47,741 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:47,741 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:47,752 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-20 03:12:47,945 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-20 03:12:47,946 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:47,947 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:47,947 INFO L85 PathProgramCache]: Analyzing trace with hash 498643504, now seen corresponding path program 1 times [2024-11-20 03:12:47,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:47,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [36242762] [2024-11-20 03:12:47,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:47,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:47,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:48,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,158 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:48,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,173 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:48,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:48,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:48,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,178 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:48,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:48,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:48,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,184 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:48,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:48,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,187 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:48,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,189 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:48,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,191 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:48,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:48,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,194 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:48,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,195 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:48,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:48,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,199 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:48,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:48,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,202 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:48,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,203 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:48,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:48,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:48,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,208 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:48,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,210 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:48,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:48,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:48,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:48,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,216 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:48,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,218 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:48,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,220 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 03:12:48,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:48,220 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [36242762] [2024-11-20 03:12:48,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [36242762] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:12:48,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578515344] [2024-11-20 03:12:48,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:48,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:12:48,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:12:48,223 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-20 03:12:48,227 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-20 03:12:48,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:48,313 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 03:12:48,317 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:12:48,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 143 proven. 84 refuted. 0 times theorem prover too weak. 1513 trivial. 0 not checked. [2024-11-20 03:12:48,615 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:12:48,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 3 proven. 84 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 03:12:48,857 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578515344] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:12:48,857 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 03:12:48,857 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 11 [2024-11-20 03:12:48,858 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1144561972] [2024-11-20 03:12:48,858 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 03:12:48,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 03:12:48,858 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:48,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 03:12:48,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-20 03:12:48,859 INFO L87 Difference]: Start difference. First operand 782 states and 1092 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-11-20 03:12:49,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:49,584 INFO L93 Difference]: Finished difference Result 2311 states and 3154 transitions. [2024-11-20 03:12:49,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 03:12:49,590 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) Word has length 188 [2024-11-20 03:12:49,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:49,608 INFO L225 Difference]: With dead ends: 2311 [2024-11-20 03:12:49,608 INFO L226 Difference]: Without dead ends: 1607 [2024-11-20 03:12:49,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 451 GetRequests, 428 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=129, Invalid=333, Unknown=0, NotChecked=0, Total=462 [2024-11-20 03:12:49,615 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 160 mSDsluCounter, 453 mSDsCounter, 0 mSdLazyCounter, 603 mSolverCounterSat, 68 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 595 SdHoareTripleChecker+Invalid, 671 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 68 IncrementalHoareTripleChecker+Valid, 603 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:49,615 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 595 Invalid, 671 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [68 Valid, 603 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-20 03:12:49,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1607 states. [2024-11-20 03:12:49,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1607 to 1203. [2024-11-20 03:12:49,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1203 states, 762 states have (on average 1.1968503937007875) internal successors, (912), 766 states have internal predecessors, (912), 384 states have call successors, (384), 56 states have call predecessors, (384), 56 states have return successors, (384), 380 states have call predecessors, (384), 384 states have call successors, (384) [2024-11-20 03:12:49,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1203 states to 1203 states and 1680 transitions. [2024-11-20 03:12:49,773 INFO L78 Accepts]: Start accepts. Automaton has 1203 states and 1680 transitions. Word has length 188 [2024-11-20 03:12:49,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:49,774 INFO L471 AbstractCegarLoop]: Abstraction has 1203 states and 1680 transitions. [2024-11-20 03:12:49,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 11 states have internal predecessors, (56), 2 states have call successors, (58), 2 states have call predecessors, (58), 4 states have return successors, (59), 2 states have call predecessors, (59), 2 states have call successors, (59) [2024-11-20 03:12:49,774 INFO L276 IsEmpty]: Start isEmpty. Operand 1203 states and 1680 transitions. [2024-11-20 03:12:49,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:12:49,775 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:49,775 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:49,785 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-20 03:12:49,976 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-20 03:12:49,976 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:49,977 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:49,977 INFO L85 PathProgramCache]: Analyzing trace with hash 500490546, now seen corresponding path program 1 times [2024-11-20 03:12:49,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:49,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278540038] [2024-11-20 03:12:49,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:49,977 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:49,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:50,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:50,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,086 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:50,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,091 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:50,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:50,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,096 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:50,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,098 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:50,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,100 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:50,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,102 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:50,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,103 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:50,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,104 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:50,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:50,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:50,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,108 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:50,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,109 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,110 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:50,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,111 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:50,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:50,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:50,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:50,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:50,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,118 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:50,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,119 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:50,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:50,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,121 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:50,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:50,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,124 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:50,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,125 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:50,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,126 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:12:50,126 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:50,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278540038] [2024-11-20 03:12:50,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278540038] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:12:50,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:12:50,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 03:12:50,127 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687742360] [2024-11-20 03:12:50,127 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:12:50,127 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 03:12:50,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:50,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 03:12:50,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:12:50,128 INFO L87 Difference]: Start difference. First operand 1203 states and 1680 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:50,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:50,203 INFO L93 Difference]: Finished difference Result 2121 states and 2986 transitions. [2024-11-20 03:12:50,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 03:12:50,204 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-20 03:12:50,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:50,209 INFO L225 Difference]: With dead ends: 2121 [2024-11-20 03:12:50,210 INFO L226 Difference]: Without dead ends: 879 [2024-11-20 03:12:50,212 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 03:12:50,213 INFO L432 NwaCegarLoop]: 121 mSDtfsCounter, 108 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 108 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:50,213 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [108 Valid, 227 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:12:50,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 879 states. [2024-11-20 03:12:50,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 879 to 877. [2024-11-20 03:12:50,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 877 states, 560 states have (on average 1.2017857142857142) internal successors, (673), 562 states have internal predecessors, (673), 282 states have call successors, (282), 34 states have call predecessors, (282), 34 states have return successors, (282), 280 states have call predecessors, (282), 282 states have call successors, (282) [2024-11-20 03:12:50,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 877 states to 877 states and 1237 transitions. [2024-11-20 03:12:50,312 INFO L78 Accepts]: Start accepts. Automaton has 877 states and 1237 transitions. Word has length 188 [2024-11-20 03:12:50,312 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:50,312 INFO L471 AbstractCegarLoop]: Abstraction has 877 states and 1237 transitions. [2024-11-20 03:12:50,312 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:12:50,313 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1237 transitions. [2024-11-20 03:12:50,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:12:50,314 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:50,314 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:50,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 03:12:50,314 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:50,314 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:50,314 INFO L85 PathProgramCache]: Analyzing trace with hash 279811545, now seen corresponding path program 1 times [2024-11-20 03:12:50,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:50,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995421527] [2024-11-20 03:12:50,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:50,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:50,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-20 03:12:50,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-20 03:12:50,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-20 03:12:50,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,488 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-20 03:12:50,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,505 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-20 03:12:50,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,511 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-20 03:12:50,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,518 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-20 03:12:50,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,525 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-20 03:12:50,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,531 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-20 03:12:50,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,537 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2024-11-20 03:12:50,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,544 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 61 [2024-11-20 03:12:50,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 66 [2024-11-20 03:12:50,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,553 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 72 [2024-11-20 03:12:50,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,559 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 77 [2024-11-20 03:12:50,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 83 [2024-11-20 03:12:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 88 [2024-11-20 03:12:50,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 94 [2024-11-20 03:12:50,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,580 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 99 [2024-11-20 03:12:50,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,587 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 105 [2024-11-20 03:12:50,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,593 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 110 [2024-11-20 03:12:50,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 116 [2024-11-20 03:12:50,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 121 [2024-11-20 03:12:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 127 [2024-11-20 03:12:50,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 132 [2024-11-20 03:12:50,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 138 [2024-11-20 03:12:50,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 143 [2024-11-20 03:12:50,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,632 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 149 [2024-11-20 03:12:50,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 154 [2024-11-20 03:12:50,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,641 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 160 [2024-11-20 03:12:50,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 165 [2024-11-20 03:12:50,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,653 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 03:12:50,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 03:12:50,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995421527] [2024-11-20 03:12:50,654 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995421527] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:12:50,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [172961969] [2024-11-20 03:12:50,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:50,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:12:50,658 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:12:50,659 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 03:12:50,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-20 03:12:50,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:50,765 INFO L255 TraceCheckSpWp]: Trace formula consists of 447 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 03:12:50,768 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:12:51,109 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 347 proven. 78 refuted. 0 times theorem prover too weak. 1315 trivial. 0 not checked. [2024-11-20 03:12:51,109 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:12:51,304 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 78 refuted. 0 times theorem prover too weak. 1653 trivial. 0 not checked. [2024-11-20 03:12:51,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [172961969] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:12:51,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 03:12:51,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-20 03:12:51,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030993458] [2024-11-20 03:12:51,305 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 03:12:51,306 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 03:12:51,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 03:12:51,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 03:12:51,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:12:51,307 INFO L87 Difference]: Start difference. First operand 877 states and 1237 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-20 03:12:51,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:51,486 INFO L93 Difference]: Finished difference Result 1140 states and 1560 transitions. [2024-11-20 03:12:51,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 03:12:51,487 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) Word has length 188 [2024-11-20 03:12:51,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:51,489 INFO L225 Difference]: With dead ends: 1140 [2024-11-20 03:12:51,489 INFO L226 Difference]: Without dead ends: 266 [2024-11-20 03:12:51,491 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 442 GetRequests, 432 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-20 03:12:51,492 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 57 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 03:12:51,492 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 159 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 03:12:51,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 266 states. [2024-11-20 03:12:51,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 266 to 244. [2024-11-20 03:12:51,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 244 states, 155 states have (on average 1.070967741935484) internal successors, (166), 156 states have internal predecessors, (166), 68 states have call successors, (68), 20 states have call predecessors, (68), 20 states have return successors, (68), 67 states have call predecessors, (68), 68 states have call successors, (68) [2024-11-20 03:12:51,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 244 states to 244 states and 302 transitions. [2024-11-20 03:12:51,520 INFO L78 Accepts]: Start accepts. Automaton has 244 states and 302 transitions. Word has length 188 [2024-11-20 03:12:51,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:51,542 INFO L471 AbstractCegarLoop]: Abstraction has 244 states and 302 transitions. [2024-11-20 03:12:51,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 2 states have call successors, (56), 2 states have call predecessors, (56), 4 states have return successors, (57), 2 states have call predecessors, (57), 2 states have call successors, (57) [2024-11-20 03:12:51,542 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 302 transitions. [2024-11-20 03:12:51,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 03:12:51,543 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:51,544 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:51,552 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-20 03:12:51,744 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:12:51,745 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:51,745 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:51,745 INFO L85 PathProgramCache]: Analyzing trace with hash -518603425, now seen corresponding path program 1 times [2024-11-20 03:12:51,745 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 03:12:51,745 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809923398] [2024-11-20 03:12:51,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:51,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 03:12:51,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-20 03:12:51,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1999904902] [2024-11-20 03:12:51,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:51,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:12:51,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:12:51,796 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 03:12:51,797 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-20 03:12:51,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:12:51,885 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-20 03:12:51,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-20 03:12:52,001 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-20 03:12:52,002 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-20 03:12:52,002 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-20 03:12:52,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 03:12:52,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 03:12:52,207 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 03:12:52,300 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 03:12:52,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 03:12:52 BoogieIcfgContainer [2024-11-20 03:12:52,302 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 03:12:52,303 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 03:12:52,303 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 03:12:52,303 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 03:12:52,303 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:09" (3/4) ... [2024-11-20 03:12:52,305 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-20 03:12:52,306 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 03:12:52,307 INFO L158 Benchmark]: Toolchain (without parser) took 44011.38ms. Allocated memory was 161.5MB in the beginning and 578.8MB in the end (delta: 417.3MB). Free memory was 86.8MB in the beginning and 457.4MB in the end (delta: -370.6MB). Peak memory consumption was 47.0MB. Max. memory is 16.1GB. [2024-11-20 03:12:52,307 INFO L158 Benchmark]: CDTParser took 0.13ms. Allocated memory is still 161.5MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:12:52,307 INFO L158 Benchmark]: CACSL2BoogieTranslator took 326.17ms. Allocated memory is still 161.5MB. Free memory was 86.6MB in the beginning and 132.9MB in the end (delta: -46.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. [2024-11-20 03:12:52,307 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.07ms. Allocated memory is still 161.5MB. Free memory was 132.9MB in the beginning and 129.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 03:12:52,307 INFO L158 Benchmark]: Boogie Preprocessor took 103.03ms. Allocated memory is still 161.5MB. Free memory was 129.9MB in the beginning and 125.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 03:12:52,308 INFO L158 Benchmark]: RCFGBuilder took 664.04ms. Allocated memory is still 161.5MB. Free memory was 125.7MB in the beginning and 115.1MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2024-11-20 03:12:52,308 INFO L158 Benchmark]: TraceAbstraction took 42844.84ms. Allocated memory was 161.5MB in the beginning and 578.8MB in the end (delta: 417.3MB). Free memory was 114.2MB in the beginning and 457.4MB in the end (delta: -343.2MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. [2024-11-20 03:12:52,308 INFO L158 Benchmark]: Witness Printer took 3.65ms. Allocated memory is still 578.8MB. Free memory is still 457.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 03:12:52,309 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.13ms. Allocated memory is still 161.5MB. Free memory is still 132.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 326.17ms. Allocated memory is still 161.5MB. Free memory was 86.6MB in the beginning and 132.9MB in the end (delta: -46.3MB). Peak memory consumption was 24.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.07ms. Allocated memory is still 161.5MB. Free memory was 132.9MB in the beginning and 129.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 103.03ms. Allocated memory is still 161.5MB. Free memory was 129.9MB in the beginning and 125.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 664.04ms. Allocated memory is still 161.5MB. Free memory was 125.7MB in the beginning and 115.1MB in the end (delta: 10.6MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42844.84ms. Allocated memory was 161.5MB in the beginning and 578.8MB in the end (delta: 417.3MB). Free memory was 114.2MB in the beginning and 457.4MB in the end (delta: -343.2MB). Peak memory consumption was 75.0MB. Max. memory is 16.1GB. * Witness Printer took 3.65ms. Allocated memory is still 578.8MB. Free memory is still 457.4MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 19]: Unable to prove that a call to reach_error is unreachable Unable to prove that a call to reach_error is unreachable Reason: overapproximation of someBinaryDOUBLEComparisonOperation at line 167, overapproximation of someBinaryArithmeticDOUBLEoperation at line 106. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned char var_1_1 = 0; [L23] unsigned char var_1_4 = 0; [L24] unsigned char var_1_5 = 0; [L25] unsigned short int var_1_6 = 4; [L26] unsigned short int var_1_9 = 4; [L27] unsigned short int var_1_10 = 10; [L28] double var_1_11 = 15.6; [L29] double var_1_12 = 256.4; [L30] double var_1_13 = 49.15; [L31] unsigned long int var_1_14 = 500; [L32] unsigned long int var_1_15 = 2173307753; [L33] unsigned long int var_1_16 = 3362224480; [L34] signed short int var_1_17 = 16; [L35] signed short int var_1_19 = 16; [L36] signed short int var_1_20 = 4; [L37] signed short int var_1_21 = 0; [L38] signed short int var_1_22 = -25; [L39] signed char var_1_23 = 1; [L40] signed char var_1_24 = 2; [L41] signed short int var_1_25 = -500; [L42] signed char var_1_26 = -2; [L43] unsigned short int var_1_27 = 256; [L44] unsigned char var_1_28 = 0; [L45] unsigned short int var_1_29 = 39250; [L46] unsigned short int var_1_30 = 256; [L47] unsigned short int var_1_31 = 25; [L48] unsigned short int var_1_32 = 4; [L49] signed char var_1_33 = -8; [L50] signed char var_1_34 = -2; [L51] unsigned short int last_1_var_1_6 = 4; [L52] unsigned short int last_1_var_1_9 = 4; [L53] unsigned long int last_1_var_1_14 = 500; [L54] signed short int last_1_var_1_17 = 16; VAL [isInitial=0, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L171] isInitial = 1 [L172] FCALL initially() [L173] COND TRUE 1 [L174] CALL updateLastVariables() [L161] last_1_var_1_6 = var_1_6 [L162] last_1_var_1_9 = var_1_9 [L163] last_1_var_1_14 = var_1_14 [L164] last_1_var_1_17 = var_1_17 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L174] RET updateLastVariables() [L175] CALL updateVariables() [L113] var_1_4 = __VERIFIER_nondet_uchar() [L114] CALL assume_abort_if_not(var_1_4 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L114] RET assume_abort_if_not(var_1_4 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_5=0, var_1_6=4, var_1_9=4] [L115] CALL assume_abort_if_not(var_1_4 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L115] RET assume_abort_if_not(var_1_4 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L116] var_1_5 = __VERIFIER_nondet_uchar() [L117] CALL assume_abort_if_not(var_1_5 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L117] RET assume_abort_if_not(var_1_5 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_6=4, var_1_9=4] [L118] CALL assume_abort_if_not(var_1_5 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L118] RET assume_abort_if_not(var_1_5 <= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=10, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L119] var_1_10 = __VERIFIER_nondet_ushort() [L120] CALL assume_abort_if_not(var_1_10 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L120] RET assume_abort_if_not(var_1_10 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L121] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_12=1282/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L122] var_1_12 = __VERIFIER_nondet_double() [L123] CALL assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L123] RET assume_abort_if_not((var_1_12 >= 0.0F && var_1_12 <= -1.0e-20F) || (var_1_12 <= 9223372.036854765600e+12F && var_1_12 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_13=983/20, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L124] var_1_13 = __VERIFIER_nondet_double() [L125] CALL assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L125] RET assume_abort_if_not((var_1_13 >= 0.0F && var_1_13 <= -1.0e-20F) || (var_1_13 <= 9223372.036854765600e+12F && var_1_13 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2173307753, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L126] var_1_15 = __VERIFIER_nondet_ulong() [L127] CALL assume_abort_if_not(var_1_15 >= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L127] RET assume_abort_if_not(var_1_15 >= 2147483647) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] CALL assume_abort_if_not(var_1_15 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L128] RET assume_abort_if_not(var_1_15 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=3362224480, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L129] var_1_16 = __VERIFIER_nondet_ulong() [L130] CALL assume_abort_if_not(var_1_16 >= 3221225470) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L130] RET assume_abort_if_not(var_1_16 >= 3221225470) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] CALL assume_abort_if_not(var_1_16 <= 4294967294) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L131] RET assume_abort_if_not(var_1_16 <= 4294967294) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=16, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L132] var_1_19 = __VERIFIER_nondet_short() [L133] CALL assume_abort_if_not(var_1_19 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L133] RET assume_abort_if_not(var_1_19 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] CALL assume_abort_if_not(var_1_19 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L134] RET assume_abort_if_not(var_1_19 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=4, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L135] var_1_20 = __VERIFIER_nondet_short() [L136] CALL assume_abort_if_not(var_1_20 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L136] RET assume_abort_if_not(var_1_20 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] CALL assume_abort_if_not(var_1_20 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L137] RET assume_abort_if_not(var_1_20 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L138] var_1_21 = __VERIFIER_nondet_short() [L139] CALL assume_abort_if_not(var_1_21 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L139] RET assume_abort_if_not(var_1_21 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] CALL assume_abort_if_not(var_1_21 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L140] RET assume_abort_if_not(var_1_21 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-25, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L141] var_1_22 = __VERIFIER_nondet_short() [L142] CALL assume_abort_if_not(var_1_22 >= -16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L142] RET assume_abort_if_not(var_1_22 >= -16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] CALL assume_abort_if_not(var_1_22 <= 16383) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L143] RET assume_abort_if_not(var_1_22 <= 16383) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=2, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L144] var_1_24 = __VERIFIER_nondet_char() [L145] CALL assume_abort_if_not(var_1_24 >= -127) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L145] RET assume_abort_if_not(var_1_24 >= -127) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] CALL assume_abort_if_not(var_1_24 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L146] RET assume_abort_if_not(var_1_24 <= 126) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=0, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L147] var_1_28 = __VERIFIER_nondet_uchar() [L148] CALL assume_abort_if_not(var_1_28 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L148] RET assume_abort_if_not(var_1_28 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] CALL assume_abort_if_not(var_1_28 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L149] RET assume_abort_if_not(var_1_28 <= 1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=39250, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L150] var_1_29 = __VERIFIER_nondet_ushort() [L151] CALL assume_abort_if_not(var_1_29 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L151] RET assume_abort_if_not(var_1_29 >= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] CALL assume_abort_if_not(var_1_29 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L152] RET assume_abort_if_not(var_1_29 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=256, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L153] var_1_30 = __VERIFIER_nondet_ushort() [L154] CALL assume_abort_if_not(var_1_30 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L154] RET assume_abort_if_not(var_1_30 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] CALL assume_abort_if_not(var_1_30 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L155] RET assume_abort_if_not(var_1_30 <= 32767) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=25, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L156] var_1_31 = __VERIFIER_nondet_ushort() [L157] CALL assume_abort_if_not(var_1_31 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L157] RET assume_abort_if_not(var_1_31 >= 0) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] CALL assume_abort_if_not(var_1_31 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L158] RET assume_abort_if_not(var_1_31 <= 65534) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=1, var_1_24=-127, var_1_25=-500, var_1_26=-2, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L175] RET updateVariables() [L176] CALL step() [L58] var_1_23 = var_1_24 [L59] var_1_25 = var_1_23 [L60] var_1_26 = var_1_24 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=256, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L61] COND TRUE \read(var_1_28) [L62] var_1_27 = (((((var_1_29 - var_1_30)) < (var_1_31)) ? ((var_1_29 - var_1_30)) : (var_1_31))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=4, var_1_33=-8, var_1_34=-2, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L64] var_1_32 = var_1_30 [L65] var_1_33 = var_1_24 [L66] var_1_34 = var_1_24 [L67] signed long int stepLocal_0 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L68] COND FALSE !(\read(var_1_5)) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L73] signed long int stepLocal_3 = last_1_var_1_9; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_3=4, var_1_10=0, var_1_11=78/5, var_1_14=500, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L74] COND TRUE last_1_var_1_14 >= stepLocal_3 [L75] var_1_14 = (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L77] COND TRUE var_1_6 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L78] COND TRUE (- var_1_14) > var_1_6 [L79] var_1_1 = 0 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L84] unsigned char stepLocal_2 = var_1_4; [L85] unsigned long int stepLocal_1 = var_1_14; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=-18, stepLocal_2=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L86] COND FALSE !(stepLocal_2 || var_1_1) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_1=-18, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=4] [L89] COND TRUE stepLocal_1 >= var_1_6 [L90] var_1_9 = var_1_10 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L95] unsigned char stepLocal_5 = var_1_1; [L96] unsigned char stepLocal_4 = var_1_1; VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_4=0, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L97] COND FALSE !(stepLocal_4 && (var_1_5 && (var_1_12 < var_1_13))) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L104] COND TRUE var_1_14 <= var_1_14 VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_11=78/5, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L105] COND TRUE ! var_1_1 [L106] var_1_11 = (var_1_12 - var_1_13) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, stepLocal_0=4, stepLocal_5=0, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L176] RET step() [L177] CALL, EXPR property() [L167-L168] return ((((((var_1_6 <= var_1_14) ? (((- var_1_14) > var_1_6) ? (var_1_1 == ((unsigned char) 0)) : 1) : (var_1_1 == ((unsigned char) (var_1_4 || var_1_5)))) && (var_1_5 ? (((last_1_var_1_14 * (last_1_var_1_6 + last_1_var_1_17)) > last_1_var_1_9) ? (var_1_6 == ((unsigned short int) 256)) : 1) : 1)) && ((var_1_4 || var_1_1) ? (var_1_9 == ((unsigned short int) ((((32) < (var_1_10)) ? (32) : (var_1_10))))) : ((var_1_14 >= var_1_6) ? (var_1_9 == ((unsigned short int) var_1_10)) : (var_1_9 == ((unsigned short int) var_1_10))))) && ((var_1_14 <= var_1_14) ? ((! var_1_1) ? (var_1_11 == ((double) (var_1_12 - var_1_13))) : 1) : (var_1_11 == ((double) var_1_12)))) && ((last_1_var_1_14 >= last_1_var_1_9) ? (var_1_14 == ((unsigned long int) (((((var_1_15) > ((var_1_16 - var_1_10))) ? (var_1_15) : ((var_1_16 - var_1_10)))) - last_1_var_1_17))) : 1)) && ((var_1_1 && (var_1_5 && (var_1_12 < var_1_13))) ? ((var_1_1 || (last_1_var_1_17 >= ((((var_1_14) > (var_1_6)) ? (var_1_14) : (var_1_6))))) ? (var_1_17 == ((signed short int) (((((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) < ((var_1_22 + 64))) ? ((((((var_1_19) > (256)) ? (var_1_19) : (256))) + (var_1_20 - var_1_21))) : ((var_1_22 + 64)))))) : (var_1_17 == ((signed short int) var_1_19))) : 1) ; VAL [\result=0, isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L177] RET, EXPR property() [L177] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] [L19] reach_error() VAL [isInitial=1, last_1_var_1_14=500, last_1_var_1_17=16, last_1_var_1_6=4, last_1_var_1_9=4, var_1_10=0, var_1_14=-18, var_1_15=2147483647, var_1_16=-2, var_1_17=16, var_1_19=-16383, var_1_1=0, var_1_20=0, var_1_21=0, var_1_22=-16383, var_1_23=-127, var_1_24=-127, var_1_25=-127, var_1_26=-127, var_1_27=0, var_1_28=-255, var_1_29=32767, var_1_30=0, var_1_31=0, var_1_32=0, var_1_33=-127, var_1_34=-127, var_1_4=0, var_1_5=0, var_1_6=4, var_1_9=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 81 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 42.7s, OverallIterations: 10, TraceHistogramMax: 30, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 7.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1494 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1432 mSDsluCounter, 3561 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2435 mSDsCounter, 532 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2731 IncrementalHoareTripleChecker+Invalid, 3263 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 532 mSolverCounterUnsat, 1126 mSDtfsCounter, 2731 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1828 GetRequests, 1657 SyntacticMatches, 4 SemanticMatches, 167 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4798 ImplicationChecksByTransitivity, 19.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1203occurred in iteration=7, InterpolantAutomatonStates: 142, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.5s AutomataMinimizationTime, 9 MinimizatonAttempts, 593 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.8s SatisfiabilityAnalysisTime, 32.1s InterpolantComputationTime, 2629 NumberOfCodeBlocks, 2629 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 2613 ConstructedInterpolants, 0 QuantifiedInterpolants, 12118 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1344 ConjunctsInSsa, 58 ConjunctsInUnsatCore, 14 InterpolantComputations, 6 PerfectInterpolantSequences, 23535/24360 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-20 03:12:52,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/current/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 /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.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 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 03:12:54,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 03:12:55,032 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-20 03:12:55,038 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 03:12:55,038 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 03:12:55,067 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 03:12:55,070 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 03:12:55,071 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 03:12:55,071 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 03:12:55,072 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 03:12:55,072 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 03:12:55,072 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 03:12:55,073 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 03:12:55,073 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 03:12:55,075 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 03:12:55,075 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 03:12:55,075 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-20 03:12:55,075 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 03:12:55,076 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 03:12:55,076 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 03:12:55,076 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-20 03:12:55,081 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 03:12:55,081 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-20 03:12:55,082 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 03:12:55,082 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-20 03:12:55,082 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 03:12:55,082 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-20 03:12:55,082 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 03:12:55,082 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-20 03:12:55,083 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 03:12:55,083 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 03:12:55,083 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 03:12:55,084 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 03:12:55,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 03:12:55,095 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:12:55,095 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 03:12:55,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 03:12:55,095 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-20 03:12:55,096 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-20 03:12:55,096 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-20 03:12:55,096 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 03:12:55,097 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 03:12:55,097 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 03:12:55,097 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 03:12:55,098 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 -> 41bee9a9aadf0e468b7f4cfab375e2e300bf35a028b98c01ecf3bf730c858df4 [2024-11-20 03:12:55,381 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 03:12:55,405 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 03:12:55,408 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 03:12:55,409 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 03:12:55,413 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 03:12:55,415 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-20 03:12:56,832 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 03:12:57,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 03:12:57,009 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-20 03:12:57,022 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0d2fb5e/f2fe3542fffe4d8fb1ce5387f9fa2360/FLAG9a321a113 [2024-11-20 03:12:57,036 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5d0d2fb5e/f2fe3542fffe4d8fb1ce5387f9fa2360 [2024-11-20 03:12:57,038 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 03:12:57,039 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 03:12:57,040 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 03:12:57,041 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 03:12:57,045 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 03:12:57,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,046 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e666670 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57, skipping insertion in model container [2024-11-20 03:12:57,061 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,087 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 03:12:57,228 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-20 03:12:57,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:12:57,318 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 03:12:57,327 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_fillercodesize_ps-cn-10_file-4.i[914,927] [2024-11-20 03:12:57,347 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 03:12:57,365 INFO L204 MainTranslator]: Completed translation [2024-11-20 03:12:57,366 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57 WrapperNode [2024-11-20 03:12:57,366 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 03:12:57,367 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 03:12:57,367 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 03:12:57,367 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 03:12:57,372 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,388 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,422 INFO L138 Inliner]: procedures = 27, calls = 43, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 185 [2024-11-20 03:12:57,425 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 03:12:57,426 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 03:12:57,426 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 03:12:57,426 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 03:12:57,435 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,436 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,445 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,463 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-20 03:12:57,464 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,464 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,495 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,498 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,504 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,509 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,512 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 03:12:57,517 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 03:12:57,517 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 03:12:57,517 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 03:12:57,518 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (1/1) ... [2024-11-20 03:12:57,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 03:12:57,539 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 03:12:57,557 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-20 03:12:57,560 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-20 03:12:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-20 03:12:57,595 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-20 03:12:57,596 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-20 03:12:57,596 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-20 03:12:57,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 03:12:57,596 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 03:12:57,675 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 03:12:57,678 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 03:12:58,419 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-20 03:12:58,419 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 03:12:58,430 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 03:12:58,430 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 03:12:58,430 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:58 BoogieIcfgContainer [2024-11-20 03:12:58,431 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 03:12:58,432 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 03:12:58,432 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 03:12:58,435 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 03:12:58,435 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 03:12:57" (1/3) ... [2024-11-20 03:12:58,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f78aabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:12:58, skipping insertion in model container [2024-11-20 03:12:58,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 03:12:57" (2/3) ... [2024-11-20 03:12:58,436 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1f78aabf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 03:12:58, skipping insertion in model container [2024-11-20 03:12:58,436 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 03:12:58" (3/3) ... [2024-11-20 03:12:58,437 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodesize_ps-cn-10_file-4.i [2024-11-20 03:12:58,450 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 03:12:58,451 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-20 03:12:58,518 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 03:12:58,528 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;@45c12e68, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 03:12:58,528 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-20 03:12:58,538 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 03:12:58,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-20 03:12:58,566 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:58,567 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:58,568 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:58,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:58,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1783273033, now seen corresponding path program 1 times [2024-11-20 03:12:58,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:12:58,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2101570109] [2024-11-20 03:12:58,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:58,587 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-20 03:12:58,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:12:58,590 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-20 03:12:58,590 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-20 03:12:58,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:58,846 INFO L255 TraceCheckSpWp]: Trace formula consists of 308 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-20 03:12:58,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:12:58,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 610 proven. 0 refuted. 0 times theorem prover too weak. 1130 trivial. 0 not checked. [2024-11-20 03:12:58,912 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:12:58,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:12:58,913 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2101570109] [2024-11-20 03:12:58,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2101570109] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:12:58,913 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:12:58,913 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 03:12:58,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [957126487] [2024-11-20 03:12:58,915 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:12:58,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-20 03:12:58,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:12:58,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-20 03:12:58,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-20 03:12:58,942 INFO L87 Difference]: Start difference. First operand has 81 states, 48 states have (on average 1.3541666666666667) internal successors, (65), 49 states have internal predecessors, (65), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 03:12:58,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:12:58,972 INFO L93 Difference]: Finished difference Result 155 states and 274 transitions. [2024-11-20 03:12:58,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-20 03:12:58,975 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) Word has length 186 [2024-11-20 03:12:58,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:12:58,980 INFO L225 Difference]: With dead ends: 155 [2024-11-20 03:12:58,981 INFO L226 Difference]: Without dead ends: 77 [2024-11-20 03:12:58,985 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 185 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-20 03:12:58,988 INFO L432 NwaCegarLoop]: 117 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, 117 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-20 03:12:58,989 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 03:12:59,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-11-20 03:12:59,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2024-11-20 03:12:59,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 45 states have (on average 1.2666666666666666) internal successors, (57), 45 states have internal predecessors, (57), 30 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 03:12:59,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 117 transitions. [2024-11-20 03:12:59,035 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 117 transitions. Word has length 186 [2024-11-20 03:12:59,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:12:59,036 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 117 transitions. [2024-11-20 03:12:59,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 21.5) internal successors, (43), 2 states have internal predecessors, (43), 2 states have call successors, (30), 2 states have call predecessors, (30), 2 states have return successors, (30), 2 states have call predecessors, (30), 2 states have call successors, (30) [2024-11-20 03:12:59,036 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 117 transitions. [2024-11-20 03:12:59,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 188 [2024-11-20 03:12:59,039 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:12:59,040 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:12:59,048 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2024-11-20 03:12:59,243 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-20 03:12:59,244 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:12:59,245 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:12:59,245 INFO L85 PathProgramCache]: Analyzing trace with hash -579856256, now seen corresponding path program 1 times [2024-11-20 03:12:59,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:12:59,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1003115326] [2024-11-20 03:12:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:12:59,247 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-20 03:12:59,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:12:59,250 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-20 03:12:59,251 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-20 03:12:59,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:12:59,487 INFO L255 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-20 03:12:59,494 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:13:00,147 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 279 proven. 159 refuted. 0 times theorem prover too weak. 1302 trivial. 0 not checked. [2024-11-20 03:13:00,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:13:00,834 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 9 proven. 162 refuted. 0 times theorem prover too weak. 1569 trivial. 0 not checked. [2024-11-20 03:13:00,834 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:13:00,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1003115326] [2024-11-20 03:13:00,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1003115326] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 03:13:00,835 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 03:13:00,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 14 [2024-11-20 03:13:00,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220603790] [2024-11-20 03:13:00,835 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 03:13:00,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 03:13:00,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:13:00,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 03:13:00,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=128, Unknown=0, NotChecked=0, Total=182 [2024-11-20 03:13:00,838 INFO L87 Difference]: Start difference. First operand 77 states and 117 transitions. Second operand has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-20 03:13:01,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:13:01,650 INFO L93 Difference]: Finished difference Result 177 states and 256 transitions. [2024-11-20 03:13:01,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-20 03:13:01,652 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) Word has length 187 [2024-11-20 03:13:01,653 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:13:01,654 INFO L225 Difference]: With dead ends: 177 [2024-11-20 03:13:01,654 INFO L226 Difference]: Without dead ends: 103 [2024-11-20 03:13:01,655 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 359 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=155, Invalid=351, Unknown=0, NotChecked=0, Total=506 [2024-11-20 03:13:01,656 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 133 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-20 03:13:01,657 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [135 Valid, 296 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-20 03:13:01,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-20 03:13:01,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 89. [2024-11-20 03:13:01,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 55 states have (on average 1.1454545454545455) internal successors, (63), 55 states have internal predecessors, (63), 30 states have call successors, (30), 3 states have call predecessors, (30), 3 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2024-11-20 03:13:01,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 123 transitions. [2024-11-20 03:13:01,706 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 123 transitions. Word has length 187 [2024-11-20 03:13:01,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:13:01,707 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 123 transitions. [2024-11-20 03:13:01,707 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.142857142857143) internal successors, (58), 14 states have internal predecessors, (58), 3 states have call successors, (58), 3 states have call predecessors, (58), 7 states have return successors, (59), 3 states have call predecessors, (59), 3 states have call successors, (59) [2024-11-20 03:13:01,707 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 123 transitions. [2024-11-20 03:13:01,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:13:01,712 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:13:01,712 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:13:01,722 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-20 03:13:01,912 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-20 03:13:01,913 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:13:01,913 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:13:01,914 INFO L85 PathProgramCache]: Analyzing trace with hash 407642383, now seen corresponding path program 1 times [2024-11-20 03:13:01,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:13:01,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [400682869] [2024-11-20 03:13:01,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:13:01,915 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-20 03:13:01,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:13:01,917 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-20 03:13:01,922 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-20 03:13:02,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:13:02,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-20 03:13:02,105 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:13:02,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:13:02,435 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:13:02,435 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:13:02,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [400682869] [2024-11-20 03:13:02,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [400682869] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:13:02,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:13:02,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:13:02,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1396484253] [2024-11-20 03:13:02,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:13:02,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:13:02,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:13:02,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:13:02,437 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:13:02,437 INFO L87 Difference]: Start difference. First operand 89 states and 123 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:13:03,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:13:03,295 INFO L93 Difference]: Finished difference Result 254 states and 353 transitions. [2024-11-20 03:13:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:13:03,296 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-20 03:13:03,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:13:03,299 INFO L225 Difference]: With dead ends: 254 [2024-11-20 03:13:03,300 INFO L226 Difference]: Without dead ends: 168 [2024-11-20 03:13:03,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2024-11-20 03:13:03,307 INFO L432 NwaCegarLoop]: 188 mSDtfsCounter, 132 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 132 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 03:13:03,308 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [132 Valid, 292 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 03:13:03,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2024-11-20 03:13:03,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 166. [2024-11-20 03:13:03,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 99 states have (on average 1.1111111111111112) internal successors, (110), 99 states have internal predecessors, (110), 60 states have call successors, (60), 6 states have call predecessors, (60), 6 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 03:13:03,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 230 transitions. [2024-11-20 03:13:03,361 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 230 transitions. Word has length 188 [2024-11-20 03:13:03,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:13:03,362 INFO L471 AbstractCegarLoop]: Abstraction has 166 states and 230 transitions. [2024-11-20 03:13:03,362 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:13:03,362 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 230 transitions. [2024-11-20 03:13:03,373 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:13:03,373 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:13:03,373 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:13:03,381 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-20 03:13:03,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 03:13:03,574 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:13:03,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:13:03,575 INFO L85 PathProgramCache]: Analyzing trace with hash 1087700753, now seen corresponding path program 1 times [2024-11-20 03:13:03,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:13:03,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1316781108] [2024-11-20 03:13:03,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:13:03,576 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-20 03:13:03,576 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:13:03,580 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 03:13:03,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-20 03:13:03,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:13:03,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-20 03:13:03,772 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:13:04,950 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 717 proven. 63 refuted. 0 times theorem prover too weak. 960 trivial. 0 not checked. [2024-11-20 03:13:04,950 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:13:05,130 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:13:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1316781108] [2024-11-20 03:13:05,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1316781108] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:13:05,131 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [844508689] [2024-11-20 03:13:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:13:05,131 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-20 03:13:05,132 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-20 03:13:05,136 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-20 03:13:05,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2024-11-20 03:13:05,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:13:05,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-20 03:13:05,756 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:13:07,047 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 818 proven. 117 refuted. 0 times theorem prover too weak. 805 trivial. 0 not checked. [2024-11-20 03:13:07,048 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 03:13:07,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [844508689] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 03:13:07,414 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-20 03:13:07,414 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 10] total 16 [2024-11-20 03:13:07,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [699353724] [2024-11-20 03:13:07,414 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-20 03:13:07,415 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 03:13:07,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:13:07,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 03:13:07,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=344, Unknown=0, NotChecked=0, Total=420 [2024-11-20 03:13:07,417 INFO L87 Difference]: Start difference. First operand 166 states and 230 transitions. Second operand has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-20 03:13:11,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:13:11,065 INFO L93 Difference]: Finished difference Result 451 states and 605 transitions. [2024-11-20 03:13:11,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-20 03:13:11,067 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) Word has length 188 [2024-11-20 03:13:11,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:13:11,071 INFO L225 Difference]: With dead ends: 451 [2024-11-20 03:13:11,071 INFO L226 Difference]: Without dead ends: 288 [2024-11-20 03:13:11,075 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 432 GetRequests, 393 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 347 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=444, Invalid=1196, Unknown=0, NotChecked=0, Total=1640 [2024-11-20 03:13:11,076 INFO L432 NwaCegarLoop]: 133 mSDtfsCounter, 304 mSDsluCounter, 400 mSDsCounter, 0 mSdLazyCounter, 749 mSolverCounterSat, 290 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 1039 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 290 IncrementalHoareTripleChecker+Valid, 749 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2024-11-20 03:13:11,076 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 533 Invalid, 1039 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [290 Valid, 749 Invalid, 0 Unknown, 0 Unchecked, 2.5s Time] [2024-11-20 03:13:11,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 288 states. [2024-11-20 03:13:11,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 288 to 268. [2024-11-20 03:13:11,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 268 states, 162 states have (on average 1.0925925925925926) internal successors, (177), 162 states have internal predecessors, (177), 90 states have call successors, (90), 15 states have call predecessors, (90), 15 states have return successors, (90), 90 states have call predecessors, (90), 90 states have call successors, (90) [2024-11-20 03:13:11,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 268 states to 268 states and 357 transitions. [2024-11-20 03:13:11,121 INFO L78 Accepts]: Start accepts. Automaton has 268 states and 357 transitions. Word has length 188 [2024-11-20 03:13:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:13:11,122 INFO L471 AbstractCegarLoop]: Abstraction has 268 states and 357 transitions. [2024-11-20 03:13:11,122 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.235294117647059) internal successors, (89), 16 states have internal predecessors, (89), 5 states have call successors, (60), 5 states have call predecessors, (60), 8 states have return successors, (60), 5 states have call predecessors, (60), 5 states have call successors, (60) [2024-11-20 03:13:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 268 states and 357 transitions. [2024-11-20 03:13:11,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-20 03:13:11,123 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:13:11,124 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:13:11,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-20 03:13:11,336 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2024-11-20 03:13:11,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-20 03:13:11,537 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:13:11,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:13:11,537 INFO L85 PathProgramCache]: Analyzing trace with hash 500894739, now seen corresponding path program 1 times [2024-11-20 03:13:11,538 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:13:11,538 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567067907] [2024-11-20 03:13:11,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:13:11,538 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-20 03:13:11,538 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:13:11,542 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 03:13:11,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-20 03:13:11,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:13:11,705 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-20 03:13:11,708 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 03:13:12,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1740 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1740 trivial. 0 not checked. [2024-11-20 03:13:12,279 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-20 03:13:12,279 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-20 03:13:12,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567067907] [2024-11-20 03:13:12,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567067907] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 03:13:12,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 03:13:12,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 03:13:12,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142751167] [2024-11-20 03:13:12,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 03:13:12,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 03:13:12,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-20 03:13:12,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 03:13:12,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 03:13:12,281 INFO L87 Difference]: Start difference. First operand 268 states and 357 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:13:13,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 03:13:13,137 INFO L93 Difference]: Finished difference Result 445 states and 590 transitions. [2024-11-20 03:13:13,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 03:13:13,148 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) Word has length 188 [2024-11-20 03:13:13,148 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 03:13:13,151 INFO L225 Difference]: With dead ends: 445 [2024-11-20 03:13:13,151 INFO L226 Difference]: Without dead ends: 180 [2024-11-20 03:13:13,153 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 184 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 03:13:13,153 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 47 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 334 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-11-20 03:13:13,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 334 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-11-20 03:13:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2024-11-20 03:13:13,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 164. [2024-11-20 03:13:13,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 93 states have (on average 1.053763440860215) internal successors, (98), 93 states have internal predecessors, (98), 60 states have call successors, (60), 10 states have call predecessors, (60), 10 states have return successors, (60), 60 states have call predecessors, (60), 60 states have call successors, (60) [2024-11-20 03:13:13,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 218 transitions. [2024-11-20 03:13:13,189 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 218 transitions. Word has length 188 [2024-11-20 03:13:13,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 03:13:13,189 INFO L471 AbstractCegarLoop]: Abstraction has 164 states and 218 transitions. [2024-11-20 03:13:13,190 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 4 states have internal predecessors, (41), 1 states have call successors, (30), 1 states have call predecessors, (30), 1 states have return successors, (30), 1 states have call predecessors, (30), 1 states have call successors, (30) [2024-11-20 03:13:13,190 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 218 transitions. [2024-11-20 03:13:13,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2024-11-20 03:13:13,191 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 03:13:13,191 INFO L215 NwaCegarLoop]: trace histogram [30, 30, 30, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-20 03:13:13,199 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-20 03:13:13,391 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-20 03:13:13,392 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-20 03:13:13,392 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 03:13:13,392 INFO L85 PathProgramCache]: Analyzing trace with hash -518603425, now seen corresponding path program 1 times [2024-11-20 03:13:13,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-20 03:13:13,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1670653631] [2024-11-20 03:13:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 03:13:13,393 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-20 03:13:13,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-20 03:13:13,398 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-20 03:13:13,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-20 03:13:13,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 03:13:13,602 INFO L255 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-20 03:13:13,607 INFO L278 TraceCheckSpWp]: Computing forward predicates...