./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:21:31,146 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:21:31,218 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-08 22:21:31,223 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:21:31,225 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:21:31,256 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:21:31,258 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:21:31,258 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:21:31,259 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:21:31,260 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:21:31,261 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:21:31,261 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:21:31,262 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:21:31,264 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:21:31,264 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:21:31,264 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:21:31,265 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:21:31,265 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:21:31,265 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-08 22:21:31,266 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:21:31,266 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:21:31,270 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:21:31,270 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:21:31,270 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:21:31,271 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:21:31,271 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:21:31,271 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:21:31,271 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:21:31,272 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:21:31,272 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:21:31,272 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:21:31,272 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:21:31,273 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:21:31,273 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:21:31,273 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:21:31,273 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:21:31,274 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-08 22:21:31,274 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-08 22:21:31,274 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:21:31,274 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:21:31,275 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:21:31,276 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:21:31,277 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 -> c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 [2024-11-08 22:21:31,490 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:21:31,513 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:21:31,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:21:31,517 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:21:31,518 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:21:31,520 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2024-11-08 22:21:32,910 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:21:33,106 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:21:33,107 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2024-11-08 22:21:33,120 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8a9b39f7/03603e2872824a90af05d8823960e58c/FLAG5b0ca8fe3 [2024-11-08 22:21:33,482 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c8a9b39f7/03603e2872824a90af05d8823960e58c [2024-11-08 22:21:33,484 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:21:33,485 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:21:33,487 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:21:33,487 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:21:33,492 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:21:33,493 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,494 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f38edf6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33, skipping insertion in model container [2024-11-08 22:21:33,494 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,523 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:21:33,690 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2024-11-08 22:21:33,792 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:21:33,805 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:21:33,818 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2024-11-08 22:21:33,852 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:21:33,875 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:21:33,879 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33 WrapperNode [2024-11-08 22:21:33,880 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:21:33,882 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:21:33,883 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:21:33,883 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:21:33,888 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,898 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,938 INFO L138 Inliner]: procedures = 26, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 240 [2024-11-08 22:21:33,939 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:21:33,940 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:21:33,940 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:21:33,940 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:21:33,951 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,951 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,957 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,981 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-08 22:21:33,982 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,982 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,994 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:33,999 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:34,007 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:34,013 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:34,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:21:34,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:21:34,024 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:21:34,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:21:34,025 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (1/1) ... [2024-11-08 22:21:34,031 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:21:34,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:21:34,061 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-08 22:21:34,067 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-08 22:21:34,109 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:21:34,109 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:21:34,110 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:21:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-08 22:21:34,110 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:21:34,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:21:34,240 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:21:34,241 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:21:34,753 INFO L? ?]: Removed 20 outVars from TransFormulas that were not future-live. [2024-11-08 22:21:34,754 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:21:34,772 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:21:34,772 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:21:34,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:34 BoogieIcfgContainer [2024-11-08 22:21:34,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:21:34,777 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:21:34,777 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:21:34,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:21:34,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:21:33" (1/3) ... [2024-11-08 22:21:34,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cb2743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:21:34, skipping insertion in model container [2024-11-08 22:21:34,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:33" (2/3) ... [2024-11-08 22:21:34,782 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55cb2743 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:21:34, skipping insertion in model container [2024-11-08 22:21:34,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:34" (3/3) ... [2024-11-08 22:21:34,784 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2024-11-08 22:21:34,798 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:21:34,798 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:21:34,857 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:21:34,863 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;@4e90285c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:21:34,863 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:21:34,870 INFO L276 IsEmpty]: Start isEmpty. Operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:21:34,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 22:21:34,886 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:34,887 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:34,888 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:34,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:34,894 INFO L85 PathProgramCache]: Analyzing trace with hash 434340029, now seen corresponding path program 1 times [2024-11-08 22:21:34,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:34,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775715064] [2024-11-08 22:21:34,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:34,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:35,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:35,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,250 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:35,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:35,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,268 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:35,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,275 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:35,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,283 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:35,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:35,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:35,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,307 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:35,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:35,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,319 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:35,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:35,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:35,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:35,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:35,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,358 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:35,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:35,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:35,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:35,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,380 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,385 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:35,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:35,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,395 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:35,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,401 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:35,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:35,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:35,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,415 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:35,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,422 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:35,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:35,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775715064] [2024-11-08 22:21:35,425 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775715064] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:35,426 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:35,426 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:21:35,428 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1410076611] [2024-11-08 22:21:35,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:35,434 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:21:35,434 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:21:35,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:21:35,462 INFO L87 Difference]: Start difference. First operand has 100 states, 69 states have (on average 1.463768115942029) internal successors, (101), 70 states have internal predecessors, (101), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:21:35,502 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:35,503 INFO L93 Difference]: Finished difference Result 193 states and 336 transitions. [2024-11-08 22:21:35,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:21:35,506 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) Word has length 184 [2024-11-08 22:21:35,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:35,515 INFO L225 Difference]: With dead ends: 193 [2024-11-08 22:21:35,515 INFO L226 Difference]: Without dead ends: 96 [2024-11-08 22:21:35,522 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:21:35,527 INFO L432 NwaCegarLoop]: 150 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, 150 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-08 22:21:35,528 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:21:35,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-08 22:21:35,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2024-11-08 22:21:35,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 66 states have (on average 1.4242424242424243) internal successors, (94), 66 states have internal predecessors, (94), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:21:35,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 150 transitions. [2024-11-08 22:21:35,585 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 150 transitions. Word has length 184 [2024-11-08 22:21:35,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:35,587 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 150 transitions. [2024-11-08 22:21:35,587 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.5) internal successors, (47), 2 states have internal predecessors, (47), 2 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:21:35,587 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 150 transitions. [2024-11-08 22:21:35,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 185 [2024-11-08 22:21:35,592 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:35,592 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:35,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-08 22:21:35,593 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:35,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:35,594 INFO L85 PathProgramCache]: Analyzing trace with hash 1812438785, now seen corresponding path program 1 times [2024-11-08 22:21:35,594 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:35,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174564093] [2024-11-08 22:21:35,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:35,595 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:35,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:35,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,987 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:35,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,991 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:35,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:35,999 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:36,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:36,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:36,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,026 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:36,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,064 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:36,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:36,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:36,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,095 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:36,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,107 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:36,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,112 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:36,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:36,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,123 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:36,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,127 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:36,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,149 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,161 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:36,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:36,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:36,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,186 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:36,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,192 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:36,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,201 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:36,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,205 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:36,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,211 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:36,212 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:36,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174564093] [2024-11-08 22:21:36,213 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174564093] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:36,213 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:36,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-08 22:21:36,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702688573] [2024-11-08 22:21:36,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:36,215 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:21:36,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:36,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:21:36,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:21:36,219 INFO L87 Difference]: Start difference. First operand 96 states and 150 transitions. Second operand has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:36,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:36,304 INFO L93 Difference]: Finished difference Result 266 states and 423 transitions. [2024-11-08 22:21:36,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:21:36,305 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 184 [2024-11-08 22:21:36,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:36,310 INFO L225 Difference]: With dead ends: 266 [2024-11-08 22:21:36,311 INFO L226 Difference]: Without dead ends: 173 [2024-11-08 22:21:36,312 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 58 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-08 22:21:36,313 INFO L432 NwaCegarLoop]: 143 mSDtfsCounter, 77 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 275 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:36,315 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 275 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:21:36,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2024-11-08 22:21:36,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 150. [2024-11-08 22:21:36,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 91 states have (on average 1.3406593406593406) internal successors, (122), 91 states have internal predecessors, (122), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:21:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 234 transitions. [2024-11-08 22:21:36,351 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 234 transitions. Word has length 184 [2024-11-08 22:21:36,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:36,355 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 234 transitions. [2024-11-08 22:21:36,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 15.666666666666666) internal successors, (47), 3 states have internal predecessors, (47), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:36,355 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 234 transitions. [2024-11-08 22:21:36,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 22:21:36,361 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:36,361 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:36,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-08 22:21:36,362 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:36,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:36,363 INFO L85 PathProgramCache]: Analyzing trace with hash -168400601, now seen corresponding path program 1 times [2024-11-08 22:21:36,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:36,364 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [333081938] [2024-11-08 22:21:36,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:36,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:36,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:36,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:36,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:36,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,601 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,604 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:36,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,607 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:36,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,610 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:36,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,612 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:36,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,616 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:36,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:36,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,623 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:36,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:36,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:36,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,633 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:36,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,636 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:36,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:36,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:36,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:36,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:36,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:36,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:36,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:36,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:36,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:36,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:36,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:36,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:36,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:36,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:36,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [333081938] [2024-11-08 22:21:36,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [333081938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:36,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:36,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:21:36,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012283793] [2024-11-08 22:21:36,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:36,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:21:36,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:36,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:21:36,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:21:36,676 INFO L87 Difference]: Start difference. First operand 150 states and 234 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:36,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:36,755 INFO L93 Difference]: Finished difference Result 267 states and 423 transitions. [2024-11-08 22:21:36,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:21:36,756 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-08 22:21:36,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:36,758 INFO L225 Difference]: With dead ends: 267 [2024-11-08 22:21:36,758 INFO L226 Difference]: Without dead ends: 174 [2024-11-08 22:21:36,762 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-08 22:21:36,763 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 74 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:36,763 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 412 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:21:36,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2024-11-08 22:21:36,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 151. [2024-11-08 22:21:36,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 92 states have (on average 1.3369565217391304) internal successors, (123), 92 states have internal predecessors, (123), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:21:36,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 235 transitions. [2024-11-08 22:21:36,793 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 235 transitions. Word has length 185 [2024-11-08 22:21:36,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:36,793 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 235 transitions. [2024-11-08 22:21:36,794 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:36,794 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 235 transitions. [2024-11-08 22:21:36,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 22:21:36,796 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:36,796 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:36,797 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-08 22:21:36,797 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:36,797 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:36,797 INFO L85 PathProgramCache]: Analyzing trace with hash 254301225, now seen corresponding path program 1 times [2024-11-08 22:21:36,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:36,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [480760546] [2024-11-08 22:21:36,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:36,798 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:36,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,001 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:37,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,004 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:37,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,006 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:37,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,010 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:37,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:37,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,016 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:37,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:37,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,019 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:37,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:37,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,023 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:37,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,025 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:37,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,027 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:37,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,030 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:37,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,034 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:37,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,040 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:37,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:37,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:37,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,050 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:37,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:37,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,055 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:37,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,057 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:37,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,059 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:37,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,061 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:37,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,063 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,068 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:37,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,070 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,073 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:37,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:37,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,077 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:37,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:37,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [480760546] [2024-11-08 22:21:37,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [480760546] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:37,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:37,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:21:37,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014907504] [2024-11-08 22:21:37,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:37,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:21:37,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:37,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:21:37,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:21:37,083 INFO L87 Difference]: Start difference. First operand 151 states and 235 transitions. Second operand has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:37,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:37,189 INFO L93 Difference]: Finished difference Result 315 states and 488 transitions. [2024-11-08 22:21:37,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:21:37,189 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-08 22:21:37,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:37,194 INFO L225 Difference]: With dead ends: 315 [2024-11-08 22:21:37,197 INFO L226 Difference]: Without dead ends: 222 [2024-11-08 22:21:37,198 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:21:37,198 INFO L432 NwaCegarLoop]: 139 mSDtfsCounter, 99 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:37,199 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 380 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:21:37,200 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 222 states. [2024-11-08 22:21:37,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 222 to 219. [2024-11-08 22:21:37,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 140 states have (on average 1.35) internal successors, (189), 141 states have internal predecessors, (189), 74 states have call successors, (74), 4 states have call predecessors, (74), 4 states have return successors, (74), 73 states have call predecessors, (74), 74 states have call successors, (74) [2024-11-08 22:21:37,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 337 transitions. [2024-11-08 22:21:37,233 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 337 transitions. Word has length 185 [2024-11-08 22:21:37,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:37,233 INFO L471 AbstractCegarLoop]: Abstraction has 219 states and 337 transitions. [2024-11-08 22:21:37,234 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.0) internal successors, (48), 4 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:37,234 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 337 transitions. [2024-11-08 22:21:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2024-11-08 22:21:37,238 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:37,238 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:37,238 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-08 22:21:37,239 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:37,239 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:37,239 INFO L85 PathProgramCache]: Analyzing trace with hash -1334046677, now seen corresponding path program 1 times [2024-11-08 22:21:37,239 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:37,240 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091909726] [2024-11-08 22:21:37,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:37,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,644 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:37,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,648 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:37,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:37,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,656 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:37,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:37,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:37,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:37,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,668 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:37,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:37,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,675 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:37,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,678 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:37,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,682 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,685 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:37,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:37,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,692 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:37,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:37,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:37,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,701 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:37,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:37,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,706 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:37,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,708 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:37,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:37,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,713 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:37,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:37,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,717 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:37,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:37,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,722 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:37,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:37,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:37,728 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:37,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:37,728 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091909726] [2024-11-08 22:21:37,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1091909726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:37,728 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:37,728 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-08 22:21:37,729 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534030483] [2024-11-08 22:21:37,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:37,729 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-08 22:21:37,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:37,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-08 22:21:37,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-08 22:21:37,730 INFO L87 Difference]: Start difference. First operand 219 states and 337 transitions. Second operand has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:38,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:38,143 INFO L93 Difference]: Finished difference Result 656 states and 1009 transitions. [2024-11-08 22:21:38,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-08 22:21:38,143 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 185 [2024-11-08 22:21:38,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:38,150 INFO L225 Difference]: With dead ends: 656 [2024-11-08 22:21:38,150 INFO L226 Difference]: Without dead ends: 496 [2024-11-08 22:21:38,151 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:21:38,151 INFO L432 NwaCegarLoop]: 156 mSDtfsCounter, 248 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 89 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 600 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 89 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:38,152 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 600 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [89 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:21:38,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2024-11-08 22:21:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 404. [2024-11-08 22:21:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 277 states have (on average 1.4115523465703972) internal successors, (391), 279 states have internal predecessors, (391), 120 states have call successors, (120), 6 states have call predecessors, (120), 6 states have return successors, (120), 118 states have call predecessors, (120), 120 states have call successors, (120) [2024-11-08 22:21:38,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 631 transitions. [2024-11-08 22:21:38,218 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 631 transitions. Word has length 185 [2024-11-08 22:21:38,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:38,219 INFO L471 AbstractCegarLoop]: Abstraction has 404 states and 631 transitions. [2024-11-08 22:21:38,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 8.0) internal successors, (48), 6 states have internal predecessors, (48), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:38,219 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 631 transitions. [2024-11-08 22:21:38,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 187 [2024-11-08 22:21:38,222 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:38,222 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:38,222 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-08 22:21:38,222 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:38,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:38,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1959788942, now seen corresponding path program 1 times [2024-11-08 22:21:38,223 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:38,223 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361811445] [2024-11-08 22:21:38,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:38,224 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:38,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:38,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,562 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:38,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,566 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:38,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:38,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:38,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:38,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:38,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,589 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:38,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:38,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,598 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:38,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:38,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,608 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:38,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,614 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:38,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:38,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:38,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:38,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,630 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:38,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,634 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:38,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:38,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:38,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,647 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:38,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,650 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:38,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,654 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:38,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:38,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:38,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,670 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:38,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,674 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:38,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:38,679 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:38,680 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:38,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361811445] [2024-11-08 22:21:38,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361811445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:38,681 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:38,681 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:21:38,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [761496812] [2024-11-08 22:21:38,681 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:38,682 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:21:38,682 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:38,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:21:38,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:21:38,683 INFO L87 Difference]: Start difference. First operand 404 states and 631 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:39,019 INFO L93 Difference]: Finished difference Result 982 states and 1528 transitions. [2024-11-08 22:21:39,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:21:39,020 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 186 [2024-11-08 22:21:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:39,025 INFO L225 Difference]: With dead ends: 982 [2024-11-08 22:21:39,025 INFO L226 Difference]: Without dead ends: 640 [2024-11-08 22:21:39,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 60 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-08 22:21:39,027 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 167 mSDsluCounter, 230 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 178 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:39,029 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 396 Invalid, 178 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:21:39,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 640 states. [2024-11-08 22:21:39,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 640 to 608. [2024-11-08 22:21:39,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 436 states have (on average 1.415137614678899) internal successors, (617), 442 states have internal predecessors, (617), 160 states have call successors, (160), 11 states have call predecessors, (160), 11 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-08 22:21:39,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 937 transitions. [2024-11-08 22:21:39,102 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 937 transitions. Word has length 186 [2024-11-08 22:21:39,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:39,103 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 937 transitions. [2024-11-08 22:21:39,103 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:39,103 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 937 transitions. [2024-11-08 22:21:39,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 22:21:39,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:39,106 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:39,106 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-08 22:21:39,106 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:39,107 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:39,107 INFO L85 PathProgramCache]: Analyzing trace with hash 342184183, now seen corresponding path program 1 times [2024-11-08 22:21:39,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:39,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890699870] [2024-11-08 22:21:39,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:39,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:39,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,232 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:39,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:39,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:39,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,240 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:39,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:39,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,244 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:39,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:39,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,251 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:39,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:39,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:39,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,257 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:39,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:39,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,261 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:39,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,263 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:39,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,265 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:39,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,267 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:39,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:39,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,272 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:39,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:39,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:39,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,278 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:39,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,280 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:39,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:39,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:39,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,287 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:39,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,289 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:39,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,291 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:39,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:39,294 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:39,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:39,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890699870] [2024-11-08 22:21:39,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1890699870] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:39,295 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:39,295 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-08 22:21:39,295 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866668003] [2024-11-08 22:21:39,295 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:39,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:21:39,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:39,296 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:21:39,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-08 22:21:39,297 INFO L87 Difference]: Start difference. First operand 608 states and 937 transitions. Second operand has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:39,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:39,385 INFO L93 Difference]: Finished difference Result 1147 states and 1776 transitions. [2024-11-08 22:21:39,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:21:39,386 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-08 22:21:39,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:39,391 INFO L225 Difference]: With dead ends: 1147 [2024-11-08 22:21:39,391 INFO L226 Difference]: Without dead ends: 634 [2024-11-08 22:21:39,393 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 57 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-08 22:21:39,393 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 69 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 412 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:39,394 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 412 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:21:39,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2024-11-08 22:21:39,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 608. [2024-11-08 22:21:39,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 436 states have (on average 1.4128440366972477) internal successors, (616), 442 states have internal predecessors, (616), 160 states have call successors, (160), 11 states have call predecessors, (160), 11 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-08 22:21:39,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 936 transitions. [2024-11-08 22:21:39,470 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 936 transitions. Word has length 188 [2024-11-08 22:21:39,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:39,471 INFO L471 AbstractCegarLoop]: Abstraction has 608 states and 936 transitions. [2024-11-08 22:21:39,471 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.75) internal successors, (51), 4 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:39,471 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 936 transitions. [2024-11-08 22:21:39,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 189 [2024-11-08 22:21:39,474 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:39,474 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:39,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-08 22:21:39,475 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:39,475 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:39,475 INFO L85 PathProgramCache]: Analyzing trace with hash 561038901, now seen corresponding path program 1 times [2024-11-08 22:21:39,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:39,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258800230] [2024-11-08 22:21:39,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:39,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:39,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:40,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,611 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:40,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:40,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,625 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:40,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:40,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,638 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:40,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,645 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:40,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,652 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:40,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,660 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:40,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:40,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,679 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:40,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,687 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:40,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:40,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,714 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:40,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,721 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:40,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:40,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,738 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:40,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,747 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:40,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,756 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:40,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,764 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:40,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,780 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:40,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,788 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:40,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,799 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:40,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,807 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:40,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,815 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:40,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,822 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:40,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:40,833 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:40,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:40,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258800230] [2024-11-08 22:21:40,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258800230] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:40,833 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:40,833 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-08 22:21:40,833 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186328018] [2024-11-08 22:21:40,834 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:40,834 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:21:40,834 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:40,834 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:21:40,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:21:40,835 INFO L87 Difference]: Start difference. First operand 608 states and 936 transitions. Second operand has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:41,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:41,611 INFO L93 Difference]: Finished difference Result 1298 states and 1975 transitions. [2024-11-08 22:21:41,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-08 22:21:41,611 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 188 [2024-11-08 22:21:41,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:41,617 INFO L225 Difference]: With dead ends: 1298 [2024-11-08 22:21:41,617 INFO L226 Difference]: Without dead ends: 800 [2024-11-08 22:21:41,619 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:21:41,620 INFO L432 NwaCegarLoop]: 138 mSDtfsCounter, 245 mSDsluCounter, 509 mSDsCounter, 0 mSdLazyCounter, 368 mSolverCounterSat, 113 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 245 SdHoareTripleChecker+Valid, 647 SdHoareTripleChecker+Invalid, 481 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 113 IncrementalHoareTripleChecker+Valid, 368 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:41,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [245 Valid, 647 Invalid, 481 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [113 Valid, 368 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-08 22:21:41,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 800 states. [2024-11-08 22:21:41,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 800 to 648. [2024-11-08 22:21:41,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 648 states, 475 states have (on average 1.3852631578947368) internal successors, (658), 481 states have internal predecessors, (658), 160 states have call successors, (160), 12 states have call predecessors, (160), 12 states have return successors, (160), 154 states have call predecessors, (160), 160 states have call successors, (160) [2024-11-08 22:21:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 648 states to 648 states and 978 transitions. [2024-11-08 22:21:41,700 INFO L78 Accepts]: Start accepts. Automaton has 648 states and 978 transitions. Word has length 188 [2024-11-08 22:21:41,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:41,701 INFO L471 AbstractCegarLoop]: Abstraction has 648 states and 978 transitions. [2024-11-08 22:21:41,701 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.666666666666667) internal successors, (51), 9 states have internal predecessors, (51), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:41,701 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 978 transitions. [2024-11-08 22:21:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:21:41,704 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:41,704 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:41,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-08 22:21:41,704 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:41,705 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:41,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1739019888, now seen corresponding path program 1 times [2024-11-08 22:21:41,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:41,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1922822362] [2024-11-08 22:21:41,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:41,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:41,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,126 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:42,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,128 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,130 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:42,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,132 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:42,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,133 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:42,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,135 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:42,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,136 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,138 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:42,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,139 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:42,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,155 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:42,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,159 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:42,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,162 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:42,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,166 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:42,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,169 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:42,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,172 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:42,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,175 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,179 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:42,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,182 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:42,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,185 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:42,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,188 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:42,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,190 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:42,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,193 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:42,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,197 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:42,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:42,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,204 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:42,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:42,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,211 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:42,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,214 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:42,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,218 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 22:21:42,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:42,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1922822362] [2024-11-08 22:21:42,218 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1922822362] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:21:42,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1044802861] [2024-11-08 22:21:42,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:42,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:21:42,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:21:42,221 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-08 22:21:42,222 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-08 22:21:42,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:42,363 INFO L255 TraceCheckSpWp]: Trace formula consists of 452 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-08 22:21:42,385 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:42,771 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 651 proven. 57 refuted. 0 times theorem prover too weak. 804 trivial. 0 not checked. [2024-11-08 22:21:42,771 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:21:43,152 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 24 proven. 57 refuted. 0 times theorem prover too weak. 1431 trivial. 0 not checked. [2024-11-08 22:21:43,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1044802861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-08 22:21:43,154 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-08 22:21:43,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 10 [2024-11-08 22:21:43,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383571531] [2024-11-08 22:21:43,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-08 22:21:43,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-08 22:21:43,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:43,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-08 22:21:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2024-11-08 22:21:43,157 INFO L87 Difference]: Start difference. First operand 648 states and 978 transitions. Second operand has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-11-08 22:21:43,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:43,696 INFO L93 Difference]: Finished difference Result 1560 states and 2304 transitions. [2024-11-08 22:21:43,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 22:21:43,697 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) Word has length 190 [2024-11-08 22:21:43,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:43,703 INFO L225 Difference]: With dead ends: 1560 [2024-11-08 22:21:43,703 INFO L226 Difference]: Without dead ends: 1046 [2024-11-08 22:21:43,705 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 446 GetRequests, 432 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:21:43,706 INFO L432 NwaCegarLoop]: 117 mSDtfsCounter, 167 mSDsluCounter, 300 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 412 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:43,706 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [183 Valid, 417 Invalid, 412 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:21:43,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1046 states. [2024-11-08 22:21:43,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1046 to 998. [2024-11-08 22:21:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 744 states have (on average 1.3548387096774193) internal successors, (1008), 758 states have internal predecessors, (1008), 224 states have call successors, (224), 29 states have call predecessors, (224), 29 states have return successors, (224), 210 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-08 22:21:43,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1456 transitions. [2024-11-08 22:21:43,809 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1456 transitions. Word has length 190 [2024-11-08 22:21:43,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:43,809 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1456 transitions. [2024-11-08 22:21:43,810 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 11.0) internal successors, (110), 10 states have internal predecessors, (110), 3 states have call successors, (66), 2 states have call predecessors, (66), 4 states have return successors, (67), 3 states have call predecessors, (67), 3 states have call successors, (67) [2024-11-08 22:21:43,810 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1456 transitions. [2024-11-08 22:21:43,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2024-11-08 22:21:43,812 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:43,812 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:43,831 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-08 22:21:44,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:21:44,014 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:44,014 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:44,014 INFO L85 PathProgramCache]: Analyzing trace with hash -2011022148, now seen corresponding path program 1 times [2024-11-08 22:21:44,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:44,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [963890043] [2024-11-08 22:21:44,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:44,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:44,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-08 22:21:44,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-08 22:21:44,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-11-08 22:21:44,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,480 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-08 22:21:44,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,487 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-11-08 22:21:44,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2024-11-08 22:21:44,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,497 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 38 [2024-11-08 22:21:44,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-08 22:21:44,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,504 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-08 22:21:44,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-08 22:21:44,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-08 22:21:44,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,516 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-08 22:21:44,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,522 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 71 [2024-11-08 22:21:44,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,526 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 76 [2024-11-08 22:21:44,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-08 22:21:44,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,534 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 87 [2024-11-08 22:21:44,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 93 [2024-11-08 22:21:44,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 98 [2024-11-08 22:21:44,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,545 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 104 [2024-11-08 22:21:44,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,549 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-08 22:21:44,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,552 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-08 22:21:44,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,556 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-08 22:21:44,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,560 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-08 22:21:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-08 22:21:44,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-08 22:21:44,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-08 22:21:44,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-08 22:21:44,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,582 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-08 22:21:44,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:44,587 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:44,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-08 22:21:44,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [963890043] [2024-11-08 22:21:44,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [963890043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:44,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:44,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-08 22:21:44,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [427060268] [2024-11-08 22:21:44,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:44,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-08 22:21:44,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-08 22:21:44,590 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-08 22:21:44,590 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-08 22:21:44,591 INFO L87 Difference]: Start difference. First operand 998 states and 1456 transitions. Second operand has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:44,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:44,872 INFO L93 Difference]: Finished difference Result 1812 states and 2642 transitions. [2024-11-08 22:21:44,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-08 22:21:44,873 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 190 [2024-11-08 22:21:44,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:44,880 INFO L225 Difference]: With dead ends: 1812 [2024-11-08 22:21:44,880 INFO L226 Difference]: Without dead ends: 1048 [2024-11-08 22:21:44,884 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2024-11-08 22:21:44,886 INFO L432 NwaCegarLoop]: 166 mSDtfsCounter, 148 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 552 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:44,887 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 552 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-08 22:21:44,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1048 states. [2024-11-08 22:21:44,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1048 to 998. [2024-11-08 22:21:44,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 998 states, 744 states have (on average 1.3494623655913978) internal successors, (1004), 758 states have internal predecessors, (1004), 224 states have call successors, (224), 29 states have call predecessors, (224), 29 states have return successors, (224), 210 states have call predecessors, (224), 224 states have call successors, (224) [2024-11-08 22:21:44,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 998 states to 998 states and 1452 transitions. [2024-11-08 22:21:44,983 INFO L78 Accepts]: Start accepts. Automaton has 998 states and 1452 transitions. Word has length 190 [2024-11-08 22:21:44,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:44,983 INFO L471 AbstractCegarLoop]: Abstraction has 998 states and 1452 transitions. [2024-11-08 22:21:44,984 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.6) internal successors, (53), 5 states have internal predecessors, (53), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:44,984 INFO L276 IsEmpty]: Start isEmpty. Operand 998 states and 1452 transitions. [2024-11-08 22:21:44,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 192 [2024-11-08 22:21:44,986 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:44,986 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:44,986 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-08 22:21:44,986 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:44,987 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:44,987 INFO L85 PathProgramCache]: Analyzing trace with hash -560017068, now seen corresponding path program 1 times [2024-11-08 22:21:44,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-08 22:21:44,987 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [593044195] [2024-11-08 22:21:44,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:44,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-08 22:21:45,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-08 22:21:45,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [147803626] [2024-11-08 22:21:45,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:45,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-08 22:21:45,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:21:45,086 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-08 22:21:45,088 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-08 22:21:45,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:21:45,223 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-08 22:21:45,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-08 22:21:45,457 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-08 22:21:45,457 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-08 22:21:45,459 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-11-08 22:21:45,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-08 22:21:45,660 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2024-11-08 22:21:45,664 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:45,792 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-08 22:21:45,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.11 10:21:45 BoogieIcfgContainer [2024-11-08 22:21:45,796 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-08 22:21:45,796 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-08 22:21:45,796 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-08 22:21:45,796 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-08 22:21:45,797 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:34" (3/4) ... [2024-11-08 22:21:45,800 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-08 22:21:45,801 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-08 22:21:45,801 INFO L158 Benchmark]: Toolchain (without parser) took 12316.05ms. Allocated memory was 155.2MB in the beginning and 383.8MB in the end (delta: 228.6MB). Free memory was 98.3MB in the beginning and 311.3MB in the end (delta: -213.0MB). Peak memory consumption was 18.3MB. Max. memory is 16.1GB. [2024-11-08 22:21:45,802 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:21:45,802 INFO L158 Benchmark]: CACSL2BoogieTranslator took 393.33ms. Allocated memory is still 155.2MB. Free memory was 97.9MB in the beginning and 80.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2024-11-08 22:21:45,802 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.80ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 74.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-08 22:21:45,803 INFO L158 Benchmark]: Boogie Preprocessor took 82.94ms. Allocated memory is still 155.2MB. Free memory was 74.9MB in the beginning and 68.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-08 22:21:45,803 INFO L158 Benchmark]: RCFGBuilder took 749.69ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 68.6MB in the beginning and 164.0MB in the end (delta: -95.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. [2024-11-08 22:21:45,804 INFO L158 Benchmark]: TraceAbstraction took 11019.08ms. Allocated memory was 220.2MB in the beginning and 383.8MB in the end (delta: 163.6MB). Free memory was 162.9MB in the beginning and 311.3MB in the end (delta: -148.4MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. [2024-11-08 22:21:45,804 INFO L158 Benchmark]: Witness Printer took 4.75ms. Allocated memory is still 383.8MB. Free memory is still 311.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-08 22:21:45,806 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.19ms. Allocated memory is still 155.2MB. Free memory is still 115.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 393.33ms. Allocated memory is still 155.2MB. Free memory was 97.9MB in the beginning and 80.3MB in the end (delta: 17.6MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.80ms. Allocated memory is still 155.2MB. Free memory was 80.3MB in the beginning and 74.9MB in the end (delta: 5.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 82.94ms. Allocated memory is still 155.2MB. Free memory was 74.9MB in the beginning and 68.6MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 749.69ms. Allocated memory was 155.2MB in the beginning and 220.2MB in the end (delta: 65.0MB). Free memory was 68.6MB in the beginning and 164.0MB in the end (delta: -95.4MB). Peak memory consumption was 17.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11019.08ms. Allocated memory was 220.2MB in the beginning and 383.8MB in the end (delta: 163.6MB). Free memory was 162.9MB in the beginning and 311.3MB in the end (delta: -148.4MB). Peak memory consumption was 201.9MB. Max. memory is 16.1GB. * Witness Printer took 4.75ms. Allocated memory is still 383.8MB. Free memory is still 311.3MB. 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 190, overapproximation of bitwiseOr at line 74, overapproximation of shiftRight at line 190. Possible FailurePath: [L21] unsigned char isInitial = 0; [L22] unsigned short int var_1_1 = 100; [L23] unsigned char var_1_6 = 0; [L24] unsigned char var_1_7 = 0; [L25] unsigned short int var_1_8 = 10; [L26] unsigned short int var_1_9 = 0; [L27] unsigned short int var_1_10 = 53946; [L28] unsigned short int var_1_11 = 1; [L29] unsigned long int var_1_12 = 8; [L30] double var_1_13 = 8.25; [L31] signed long int var_1_14 = -256; [L32] double var_1_15 = 0.19999999999999996; [L33] signed long int var_1_16 = -16; [L34] signed char var_1_17 = 1; [L35] signed char var_1_18 = 4; [L36] signed char var_1_19 = 64; [L37] signed long int var_1_20 = 1; [L38] signed long int var_1_21 = 1000000000; [L39] unsigned char var_1_23 = 4; [L40] unsigned char var_1_26 = 0; [L41] unsigned short int var_1_28 = 16; [L42] signed short int var_1_30 = -256; [L43] signed short int var_1_32 = 8; [L44] unsigned short int var_1_33 = 128; [L45] double var_1_34 = 0.25; [L46] signed long int var_1_36 = -32; [L47] unsigned char var_1_38 = 0; [L48] unsigned char var_1_39 = 1; [L49] float var_1_40 = 2.6; [L50] unsigned char var_1_41 = 0; [L51] unsigned char var_1_42 = 0; [L52] unsigned short int last_1_var_1_1 = 100; [L53] unsigned long int last_1_var_1_12 = 8; [L54] double last_1_var_1_13 = 8.25; [L55] signed long int last_1_var_1_16 = -16; VAL [isInitial=0, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L194] isInitial = 1 [L195] FCALL initially() [L196] COND TRUE 1 [L197] CALL updateLastVariables() [L184] last_1_var_1_1 = var_1_1 [L185] last_1_var_1_12 = var_1_12 [L186] last_1_var_1_13 = var_1_13 [L187] last_1_var_1_16 = var_1_16 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=0, var_1_7=0, var_1_8=10, var_1_9=0] [L197] RET updateLastVariables() [L198] CALL updateVariables() [L140] var_1_6 = __VERIFIER_nondet_uchar() [L141] CALL assume_abort_if_not(var_1_6 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L141] RET assume_abort_if_not(var_1_6 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_7=0, var_1_8=10, var_1_9=0] [L142] CALL assume_abort_if_not(var_1_6 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L142] RET assume_abort_if_not(var_1_6 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=0, var_1_8=10, var_1_9=0] [L143] var_1_7 = __VERIFIER_nondet_uchar() [L144] CALL assume_abort_if_not(var_1_7 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L144] RET assume_abort_if_not(var_1_7 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_8=10, var_1_9=0] [L145] CALL assume_abort_if_not(var_1_7 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L145] RET assume_abort_if_not(var_1_7 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=10, var_1_9=0] [L146] var_1_8 = __VERIFIER_nondet_ushort() [L147] CALL assume_abort_if_not(var_1_8 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L147] RET assume_abort_if_not(var_1_8 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_9=0] [L148] CALL assume_abort_if_not(var_1_8 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=0] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=0] [L148] RET assume_abort_if_not(var_1_8 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=0] [L149] var_1_9 = __VERIFIER_nondet_ushort() [L150] CALL assume_abort_if_not(var_1_9 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768] [L150] RET assume_abort_if_not(var_1_9 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768] [L151] CALL assume_abort_if_not(var_1_9 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L151] RET assume_abort_if_not(var_1_9 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=53946, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L152] var_1_10 = __VERIFIER_nondet_ushort() [L153] CALL assume_abort_if_not(var_1_10 >= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L153] RET assume_abort_if_not(var_1_10 >= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L154] CALL assume_abort_if_not(var_1_10 <= 65534) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L154] RET assume_abort_if_not(var_1_10 <= 65534) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=1, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L155] var_1_11 = __VERIFIER_nondet_ushort() [L156] CALL assume_abort_if_not(var_1_11 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L156] RET assume_abort_if_not(var_1_11 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L157] CALL assume_abort_if_not(var_1_11 <= 32767) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L157] RET assume_abort_if_not(var_1_11 <= 32767) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-256, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L158] var_1_14 = __VERIFIER_nondet_long() [L159] CALL assume_abort_if_not(var_1_14 >= -2147483648) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L159] RET assume_abort_if_not(var_1_14 >= -2147483648) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L160] CALL assume_abort_if_not(var_1_14 <= 2147483647) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L160] RET assume_abort_if_not(var_1_14 <= 2147483647) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L161] CALL assume_abort_if_not(var_1_14 != 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L161] RET assume_abort_if_not(var_1_14 != 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=4999999999999999/25000000000000000, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L162] var_1_15 = __VERIFIER_nondet_double() [L163] CALL assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L163] RET assume_abort_if_not((var_1_15 >= -922337.2036854765600e+13F && var_1_15 <= -1.0e-20F) || (var_1_15 <= 9223372.036854765600e+12F && var_1_15 >= 1.0e-20F )) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=4, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L164] var_1_18 = __VERIFIER_nondet_char() [L165] CALL assume_abort_if_not(var_1_18 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L165] RET assume_abort_if_not(var_1_18 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L166] CALL assume_abort_if_not(var_1_18 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L166] RET assume_abort_if_not(var_1_18 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=64, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L167] var_1_19 = __VERIFIER_nondet_char() [L168] CALL assume_abort_if_not(var_1_19 >= 63) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L168] RET assume_abort_if_not(var_1_19 >= 63) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L169] CALL assume_abort_if_not(var_1_19 <= 126) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L169] RET assume_abort_if_not(var_1_19 <= 126) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=1000000000, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L170] var_1_21 = __VERIFIER_nondet_long() [L171] CALL assume_abort_if_not(var_1_21 >= 536870911) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L171] RET assume_abort_if_not(var_1_21 >= 536870911) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L172] CALL assume_abort_if_not(var_1_21 <= 1073741823) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L172] RET assume_abort_if_not(var_1_21 <= 1073741823) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=0, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L173] var_1_26 = __VERIFIER_nondet_uchar() [L174] CALL assume_abort_if_not(var_1_26 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L174] RET assume_abort_if_not(var_1_26 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L175] CALL assume_abort_if_not(var_1_26 <= 64) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L175] RET assume_abort_if_not(var_1_26 <= 64) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L176] var_1_39 = __VERIFIER_nondet_uchar() [L177] CALL assume_abort_if_not(var_1_39 >= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L177] RET assume_abort_if_not(var_1_39 >= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L178] CALL assume_abort_if_not(var_1_39 <= 1) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L178] RET assume_abort_if_not(var_1_39 <= 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L179] var_1_42 = __VERIFIER_nondet_uchar() [L180] CALL assume_abort_if_not(var_1_42 >= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L180] RET assume_abort_if_not(var_1_42 >= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L181] CALL assume_abort_if_not(var_1_42 <= 0) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L20] COND FALSE !(!cond) VAL [\old(cond)=1, isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L181] RET assume_abort_if_not(var_1_42 <= 0) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L198] RET updateVariables() [L199] CALL step() [L59] COND FALSE !((var_1_20 + var_1_20) > 16) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=4, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L62] COND TRUE (~ var_1_20) <= var_1_18 [L63] var_1_23 = var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=16, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L68] var_1_28 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=-256, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L69] COND TRUE var_1_16 < 2 [L70] var_1_30 = (((((((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) > (var_1_12)) ? (((((var_1_26) > (var_1_19)) ? (var_1_26) : (var_1_19)))) : (var_1_12))) + var_1_19) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L74] EXPR var_1_11 | var_1_20 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L74] COND FALSE !((~ (var_1_11 | var_1_20)) >= (~ (~ 32))) [L77] EXPR var_1_19 >> var_1_18 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L77] COND FALSE !((var_1_19 >> var_1_18) <= var_1_18) [L82] COND FALSE !(var_1_12 >= var_1_11) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L87] COND FALSE !(((var_1_8 - var_1_19) > var_1_8) && var_1_6) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=0, var_1_39=1, var_1_40=13/5, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L90] var_1_38 = var_1_39 [L91] var_1_40 = var_1_15 [L92] var_1_41 = var_1_42 [L93] unsigned char stepLocal_0 = last_1_var_1_13 >= last_1_var_1_13; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_0=0, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=100, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L94] COND FALSE !((last_1_var_1_12 == last_1_var_1_1) && stepLocal_0) [L105] var_1_1 = var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L107] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=1, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L107] COND FALSE !((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) [L112] var_1_17 = (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1))))) [L113] unsigned long int stepLocal_4 = var_1_12; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=1, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L114] COND TRUE \read(var_1_6) [L115] var_1_20 = ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_4=8, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L123] unsigned char stepLocal_3 = var_1_6; [L124] unsigned char stepLocal_2 = var_1_6; VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_2=1, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=-16, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L125] COND FALSE !(stepLocal_2 && (var_1_9 < (var_1_10 + var_1_20))) [L130] var_1_16 = var_1_8 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L132] signed long int stepLocal_1 = ((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14); VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_1=32768, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=33/4, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L133] COND TRUE stepLocal_1 >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8))) [L134] var_1_13 = var_1_15 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, stepLocal_3=1, stepLocal_4=8, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L199] RET step() [L200] CALL, EXPR property() [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L190] EXPR ((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10 VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L190] EXPR (((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L190-L191] return (((((((last_1_var_1_12 == last_1_var_1_1) && (last_1_var_1_13 >= last_1_var_1_13)) ? (var_1_6 ? (var_1_7 ? (var_1_1 == ((unsigned short int) ((((var_1_8) < (var_1_9)) ? (var_1_8) : (var_1_9))))) : (var_1_1 == ((unsigned short int) ((((var_1_9) > (var_1_8)) ? (var_1_9) : (var_1_8)))))) : (var_1_1 == ((unsigned short int) (((((46167) > (var_1_10)) ? (46167) : (var_1_10))) - var_1_11)))) : (var_1_1 == ((unsigned short int) var_1_10))) && (((((((var_1_11) < (16)) ? (var_1_11) : (16))) >> var_1_10) >= last_1_var_1_16) ? (var_1_7 ? (var_1_12 == ((unsigned long int) var_1_10)) : 1) : 1)) && (((((((var_1_10) < (var_1_1)) ? (var_1_10) : (var_1_1))) + (var_1_9 % var_1_14)) >= ((((var_1_16) < (var_1_8)) ? (var_1_16) : (var_1_8)))) ? (var_1_13 == ((double) var_1_15)) : (var_1_13 == ((double) var_1_15)))) && ((var_1_6 && (var_1_9 < (var_1_10 + var_1_20))) ? ((var_1_7 && var_1_6) ? (var_1_16 == ((signed long int) var_1_10)) : 1) : (var_1_16 == ((signed long int) var_1_8)))) && (var_1_17 == ((signed char) (4 - ((((var_1_18) < ((var_1_19 - 1))) ? (var_1_18) : ((var_1_19 - 1)))))))) && (var_1_6 ? (var_1_20 == ((signed long int) ((var_1_8 - (var_1_21 - var_1_11)) + var_1_10))) : (((~ var_1_19) == var_1_12) ? (var_1_20 == ((signed long int) var_1_1)) : (var_1_20 == ((signed long int) var_1_10)))) ; [L200] RET, EXPR property() [L200] CALL __VERIFIER_assert(property()) [L19] COND TRUE !(cond) VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] [L19] reach_error() VAL [isInitial=1, last_1_var_1_12=8, last_1_var_1_13=33/4, last_1_var_1_16=-16, last_1_var_1_1=100, var_1_10=32767, var_1_11=-32769, var_1_12=8, var_1_13=2, var_1_14=-2, var_1_15=2, var_1_16=32768, var_1_17=4, var_1_18=0, var_1_19=63, var_1_1=32767, var_1_20=-536772609, var_1_21=536870911, var_1_23=0, var_1_26=-193, var_1_28=32767, var_1_30=126, var_1_32=8, var_1_33=128, var_1_34=1/4, var_1_36=-32, var_1_38=1, var_1_39=1, var_1_40=2, var_1_41=0, var_1_42=0, var_1_6=1, var_1_7=1, var_1_8=32768, var_1_9=-65535] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 100 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.8s, OverallIterations: 11, TraceHistogramMax: 28, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 2.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1310 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1294 mSDsluCounter, 4241 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2782 mSDsCounter, 357 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1367 IncrementalHoareTripleChecker+Invalid, 1724 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 357 mSolverCounterUnsat, 1459 mSDtfsCounter, 1367 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1042 GetRequests, 990 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=998occurred in iteration=9, InterpolantAutomatonStates: 56, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 10 MinimizatonAttempts, 449 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.4s InterpolantComputationTime, 2437 NumberOfCodeBlocks, 2437 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 2233 ConstructedInterpolants, 0 QuantifiedInterpolants, 7398 SizeOfPredicates, 1 NumberOfNonLiveVariables, 452 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 12 InterpolantComputations, 9 PerfectInterpolantSequences, 17973/18144 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-08 22:21:45,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-08 22:21:48,205 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-08 22:21:48,285 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2024-11-08 22:21:48,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-08 22:21:48,294 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-08 22:21:48,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-08 22:21:48,324 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-08 22:21:48,325 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-08 22:21:48,325 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-08 22:21:48,326 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-08 22:21:48,326 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-08 22:21:48,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-08 22:21:48,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-08 22:21:48,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-08 22:21:48,328 INFO L153 SettingsManager]: * Use SBE=true [2024-11-08 22:21:48,328 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-08 22:21:48,328 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-08 22:21:48,329 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-08 22:21:48,329 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-08 22:21:48,329 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-08 22:21:48,330 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-08 22:21:48,330 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-08 22:21:48,331 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-08 22:21:48,331 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-08 22:21:48,331 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-08 22:21:48,331 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-08 22:21:48,332 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-08 22:21:48,332 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-08 22:21:48,332 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-08 22:21:48,333 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-08 22:21:48,333 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-08 22:21:48,333 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-08 22:21:48,334 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-08 22:21:48,334 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-08 22:21:48,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:21:48,339 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-08 22:21:48,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-08 22:21:48,341 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-08 22:21:48,342 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-08 22:21:48,342 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-08 22:21:48,342 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-08 22:21:48,343 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-08 22:21:48,343 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-08 22:21:48,343 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-08 22:21:48,344 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 -> c579f29dd297151eeefedc3486049e913885e258239c3282b0f6f33e5cae0f92 [2024-11-08 22:21:48,691 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-08 22:21:48,718 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-08 22:21:48,722 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-08 22:21:48,723 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-08 22:21:48,724 INFO L274 PluginConnector]: CDTParser initialized [2024-11-08 22:21:48,725 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2024-11-08 22:21:50,424 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-08 22:21:50,662 INFO L384 CDTParser]: Found 1 translation units. [2024-11-08 22:21:50,662 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2024-11-08 22:21:50,675 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9baaeb079/2ae7ada0886e48eab0cfe7a509c80473/FLAG1b0841ea1 [2024-11-08 22:21:51,008 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9baaeb079/2ae7ada0886e48eab0cfe7a509c80473 [2024-11-08 22:21:51,011 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-08 22:21:51,013 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-08 22:21:51,014 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-08 22:21:51,014 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-08 22:21:51,019 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-08 22:21:51,020 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,021 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42b050e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51, skipping insertion in model container [2024-11-08 22:21:51,022 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,054 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-08 22:21:51,253 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2024-11-08 22:21:51,344 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:21:51,365 INFO L200 MainTranslator]: Completed pre-run [2024-11-08 22:21:51,378 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i[919,932] [2024-11-08 22:21:51,431 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-08 22:21:51,458 INFO L204 MainTranslator]: Completed translation [2024-11-08 22:21:51,459 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51 WrapperNode [2024-11-08 22:21:51,459 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-08 22:21:51,460 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-08 22:21:51,460 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-08 22:21:51,460 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-08 22:21:51,467 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,537 INFO L138 Inliner]: procedures = 27, calls = 41, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 192 [2024-11-08 22:21:51,539 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-08 22:21:51,539 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-08 22:21:51,539 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-08 22:21:51,539 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-08 22:21:51,553 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,553 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,563 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,586 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-08 22:21:51,586 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,586 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,600 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,607 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,613 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,621 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,629 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-08 22:21:51,630 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-08 22:21:51,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-08 22:21:51,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-08 22:21:51,633 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (1/1) ... [2024-11-08 22:21:51,639 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-08 22:21:51,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-08 22:21:51,668 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-08 22:21:51,671 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-08 22:21:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-08 22:21:51,721 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-08 22:21:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-08 22:21:51,722 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-08 22:21:51,722 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-08 22:21:51,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-08 22:21:51,831 INFO L238 CfgBuilder]: Building ICFG [2024-11-08 22:21:51,834 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-08 22:21:52,418 INFO L? ?]: Removed 18 outVars from TransFormulas that were not future-live. [2024-11-08 22:21:52,418 INFO L287 CfgBuilder]: Performing block encoding [2024-11-08 22:21:52,435 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-08 22:21:52,436 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-08 22:21:52,436 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:52 BoogieIcfgContainer [2024-11-08 22:21:52,437 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-08 22:21:52,439 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-08 22:21:52,439 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-08 22:21:52,443 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-08 22:21:52,444 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.11 10:21:51" (1/3) ... [2024-11-08 22:21:52,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0b9834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:21:52, skipping insertion in model container [2024-11-08 22:21:52,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.11 10:21:51" (2/3) ... [2024-11-08 22:21:52,445 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d0b9834 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.11 10:21:52, skipping insertion in model container [2024-11-08 22:21:52,445 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.11 10:21:52" (3/3) ... [2024-11-08 22:21:52,446 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_fillercode_fillercodestructure_filler-ps-ci_file-92.i [2024-11-08 22:21:52,465 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-08 22:21:52,466 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-08 22:21:52,539 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-08 22:21:52,546 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;@34719897, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-08 22:21:52,546 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-08 22:21:52,551 INFO L276 IsEmpty]: Start isEmpty. Operand has 85 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:21:52,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:21:52,570 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:52,570 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:52,571 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:52,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:52,575 INFO L85 PathProgramCache]: Analyzing trace with hash 985355664, now seen corresponding path program 1 times [2024-11-08 22:21:52,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:21:52,588 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [409815467] [2024-11-08 22:21:52,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:52,588 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-08 22:21:52,588 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:21:52,591 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-08 22:21:52,592 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-08 22:21:52,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:52,932 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-08 22:21:52,951 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:53,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 614 proven. 0 refuted. 0 times theorem prover too weak. 898 trivial. 0 not checked. [2024-11-08 22:21:53,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:21:53,022 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:21:53,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [409815467] [2024-11-08 22:21:53,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [409815467] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:53,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:53,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:21:53,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041814438] [2024-11-08 22:21:53,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:53,030 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-08 22:21:53,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:21:53,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-08 22:21:53,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-08 22:21:53,054 INFO L87 Difference]: Start difference. First operand has 85 states, 54 states have (on average 1.4444444444444444) internal successors, (78), 55 states have internal predecessors, (78), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:21:53,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:53,082 INFO L93 Difference]: Finished difference Result 163 states and 290 transitions. [2024-11-08 22:21:53,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-08 22:21:53,085 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) Word has length 179 [2024-11-08 22:21:53,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:53,092 INFO L225 Difference]: With dead ends: 163 [2024-11-08 22:21:53,092 INFO L226 Difference]: Without dead ends: 81 [2024-11-08 22:21:53,096 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 178 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-08 22:21:53,100 INFO L432 NwaCegarLoop]: 126 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, 126 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-08 22:21:53,101 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-08 22:21:53,117 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-08 22:21:53,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-08 22:21:53,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.3725490196078431) internal successors, (70), 51 states have internal predecessors, (70), 28 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 28 states have call predecessors, (28), 28 states have call successors, (28) [2024-11-08 22:21:53,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 126 transitions. [2024-11-08 22:21:53,148 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 126 transitions. Word has length 179 [2024-11-08 22:21:53,148 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:53,148 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 126 transitions. [2024-11-08 22:21:53,149 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (28), 2 states have call predecessors, (28), 2 states have return successors, (28), 2 states have call predecessors, (28), 2 states have call successors, (28) [2024-11-08 22:21:53,149 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 126 transitions. [2024-11-08 22:21:53,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2024-11-08 22:21:53,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:53,155 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:53,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-08 22:21:53,357 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-08 22:21:53,357 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:53,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:53,358 INFO L85 PathProgramCache]: Analyzing trace with hash -1345954612, now seen corresponding path program 1 times [2024-11-08 22:21:53,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:21:53,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2110913187] [2024-11-08 22:21:53,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:53,360 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-08 22:21:53,360 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:21:53,363 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-08 22:21:53,364 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-08 22:21:53,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:53,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-08 22:21:53,662 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:54,138 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:54,138 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:21:54,139 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:21:54,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2110913187] [2024-11-08 22:21:54,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2110913187] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:54,139 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-08 22:21:54,139 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-08 22:21:54,139 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012780440] [2024-11-08 22:21:54,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:54,141 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-08 22:21:54,141 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:21:54,142 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-08 22:21:54,142 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-08 22:21:54,142 INFO L87 Difference]: Start difference. First operand 81 states and 126 transitions. Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:54,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:54,232 INFO L93 Difference]: Finished difference Result 226 states and 358 transitions. [2024-11-08 22:21:54,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-08 22:21:54,237 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 179 [2024-11-08 22:21:54,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:54,240 INFO L225 Difference]: With dead ends: 226 [2024-11-08 22:21:54,240 INFO L226 Difference]: Without dead ends: 148 [2024-11-08 22:21:54,241 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 177 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-08 22:21:54,242 INFO L432 NwaCegarLoop]: 122 mSDtfsCounter, 29 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:54,243 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 233 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-08 22:21:54,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-08 22:21:54,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 134. [2024-11-08 22:21:54,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 75 states have (on average 1.28) internal successors, (96), 75 states have internal predecessors, (96), 56 states have call successors, (56), 2 states have call predecessors, (56), 2 states have return successors, (56), 56 states have call predecessors, (56), 56 states have call successors, (56) [2024-11-08 22:21:54,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 208 transitions. [2024-11-08 22:21:54,284 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 208 transitions. Word has length 179 [2024-11-08 22:21:54,285 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:54,285 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 208 transitions. [2024-11-08 22:21:54,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 14.0) internal successors, (42), 2 states have internal predecessors, (42), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:54,286 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 208 transitions. [2024-11-08 22:21:54,291 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2024-11-08 22:21:54,291 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:54,291 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:54,303 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-08 22:21:54,492 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-08 22:21:54,493 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:54,493 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:54,493 INFO L85 PathProgramCache]: Analyzing trace with hash -1769346158, now seen corresponding path program 1 times [2024-11-08 22:21:54,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:21:54,494 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [827365896] [2024-11-08 22:21:54,494 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:54,494 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-08 22:21:54,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:21:54,496 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-08 22:21:54,497 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-08 22:21:54,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:54,745 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:21:54,751 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:54,916 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-08 22:21:54,916 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:21:55,016 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:21:55,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [827365896] [2024-11-08 22:21:55,017 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [827365896] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:21:55,017 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2118409597] [2024-11-08 22:21:55,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:55,017 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:21:55,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:21:55,021 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 22:21:55,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Waiting until timeout for monitored process [2024-11-08 22:21:55,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:55,597 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-08 22:21:55,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:56,041 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1512 trivial. 0 not checked. [2024-11-08 22:21:56,041 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-08 22:21:56,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2118409597] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-08 22:21:56,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-08 22:21:56,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [5] total 7 [2024-11-08 22:21:56,042 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449604744] [2024-11-08 22:21:56,042 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-08 22:21:56,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-08 22:21:56,043 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:21:56,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-08 22:21:56,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-08 22:21:56,046 INFO L87 Difference]: Start difference. First operand 134 states and 208 transitions. Second operand has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:56,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:56,453 INFO L93 Difference]: Finished difference Result 300 states and 465 transitions. [2024-11-08 22:21:56,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-08 22:21:56,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) Word has length 180 [2024-11-08 22:21:56,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:56,460 INFO L225 Difference]: With dead ends: 300 [2024-11-08 22:21:56,462 INFO L226 Difference]: Without dead ends: 221 [2024-11-08 22:21:56,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 382 GetRequests, 375 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-08 22:21:56,467 INFO L432 NwaCegarLoop]: 130 mSDtfsCounter, 101 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 364 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:56,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 364 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-08 22:21:56,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states. [2024-11-08 22:21:56,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 210. [2024-11-08 22:21:56,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 122 states have (on average 1.3032786885245902) internal successors, (159), 122 states have internal predecessors, (159), 84 states have call successors, (84), 3 states have call predecessors, (84), 3 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 22:21:56,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 327 transitions. [2024-11-08 22:21:56,526 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 327 transitions. Word has length 180 [2024-11-08 22:21:56,527 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:56,527 INFO L471 AbstractCegarLoop]: Abstraction has 210 states and 327 transitions. [2024-11-08 22:21:56,527 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.75) internal successors, (43), 3 states have internal predecessors, (43), 1 states have call successors, (28), 1 states have call predecessors, (28), 1 states have return successors, (28), 1 states have call predecessors, (28), 1 states have call successors, (28) [2024-11-08 22:21:56,528 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 327 transitions. [2024-11-08 22:21:56,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 22:21:56,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:56,530 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:56,541 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-08 22:21:56,741 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (5)] Ended with exit code 0 [2024-11-08 22:21:56,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2024-11-08 22:21:56,935 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:56,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:56,936 INFO L85 PathProgramCache]: Analyzing trace with hash -238027127, now seen corresponding path program 1 times [2024-11-08 22:21:56,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:21:56,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [146712953] [2024-11-08 22:21:56,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:56,937 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-08 22:21:56,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:21:56,941 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-08 22:21:56,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-08 22:21:57,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:57,184 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-08 22:21:57,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 711 proven. 27 refuted. 0 times theorem prover too weak. 774 trivial. 0 not checked. [2024-11-08 22:21:57,325 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:21:57,393 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-08 22:21:57,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [146712953] [2024-11-08 22:21:57,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [146712953] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:21:57,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2113327614] [2024-11-08 22:21:57,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:57,393 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2024-11-08 22:21:57,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2024-11-08 22:21:57,397 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2024-11-08 22:21:57,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2024-11-08 22:21:58,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:58,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-08 22:21:58,215 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-08 22:21:58,588 INFO L134 CoverageAnalysis]: Checked inductivity of 1512 backedges. 814 proven. 57 refuted. 0 times theorem prover too weak. 641 trivial. 0 not checked. [2024-11-08 22:21:58,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-08 22:21:58,696 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2113327614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-08 22:21:58,696 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-08 22:21:58,696 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 9] total 9 [2024-11-08 22:21:58,696 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342620366] [2024-11-08 22:21:58,696 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-08 22:21:58,697 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-08 22:21:58,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-08 22:21:58,698 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-08 22:21:58,698 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-08 22:21:58,698 INFO L87 Difference]: Start difference. First operand 210 states and 327 transitions. Second operand has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-08 22:21:59,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-08 22:21:59,170 INFO L93 Difference]: Finished difference Result 394 states and 594 transitions. [2024-11-08 22:21:59,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-08 22:21:59,171 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) Word has length 181 [2024-11-08 22:21:59,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-08 22:21:59,176 INFO L225 Difference]: With dead ends: 394 [2024-11-08 22:21:59,176 INFO L226 Difference]: Without dead ends: 240 [2024-11-08 22:21:59,178 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 414 GetRequests, 399 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2024-11-08 22:21:59,179 INFO L432 NwaCegarLoop]: 80 mSDtfsCounter, 74 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-08 22:21:59,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 241 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-08 22:21:59,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2024-11-08 22:21:59,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 234. [2024-11-08 22:21:59,224 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 234 states, 140 states have (on average 1.25) internal successors, (175), 140 states have internal predecessors, (175), 84 states have call successors, (84), 9 states have call predecessors, (84), 9 states have return successors, (84), 84 states have call predecessors, (84), 84 states have call successors, (84) [2024-11-08 22:21:59,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 234 states to 234 states and 343 transitions. [2024-11-08 22:21:59,226 INFO L78 Accepts]: Start accepts. Automaton has 234 states and 343 transitions. Word has length 181 [2024-11-08 22:21:59,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-08 22:21:59,227 INFO L471 AbstractCegarLoop]: Abstraction has 234 states and 343 transitions. [2024-11-08 22:21:59,227 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 7.888888888888889) internal successors, (71), 9 states have internal predecessors, (71), 4 states have call successors, (39), 4 states have call predecessors, (39), 6 states have return successors, (40), 4 states have call predecessors, (40), 4 states have call successors, (40) [2024-11-08 22:21:59,228 INFO L276 IsEmpty]: Start isEmpty. Operand 234 states and 343 transitions. [2024-11-08 22:21:59,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 182 [2024-11-08 22:21:59,234 INFO L207 NwaCegarLoop]: Found error trace [2024-11-08 22:21:59,234 INFO L215 NwaCegarLoop]: trace histogram [28, 28, 28, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-08 22:21:59,245 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2024-11-08 22:21:59,443 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-08 22:21:59,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-08 22:21:59,635 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-08 22:21:59,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-08 22:21:59,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1517890805, now seen corresponding path program 1 times [2024-11-08 22:21:59,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-08 22:21:59,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [696953538] [2024-11-08 22:21:59,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-08 22:21:59,636 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-08 22:21:59,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-08 22:21:59,639 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-08 22:21:59,640 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-08 22:21:59,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-08 22:21:59,902 INFO L255 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-11-08 22:21:59,909 INFO L278 TraceCheckSpWp]: Computing forward predicates...