/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/loops/invert_string-3.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-6c470ae [2022-02-15 03:38:14,716 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-15 03:38:14,718 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-15 03:38:14,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-15 03:38:14,776 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-15 03:38:14,778 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-15 03:38:14,780 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-15 03:38:14,784 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-15 03:38:14,785 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-15 03:38:14,791 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-15 03:38:14,792 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-15 03:38:14,793 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-15 03:38:14,793 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-15 03:38:14,794 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-15 03:38:14,794 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-15 03:38:14,795 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-15 03:38:14,796 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-15 03:38:14,796 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-15 03:38:14,797 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-15 03:38:14,799 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-15 03:38:14,799 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-15 03:38:14,800 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-15 03:38:14,801 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-15 03:38:14,802 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-15 03:38:14,804 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-15 03:38:14,804 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-15 03:38:14,804 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-15 03:38:14,805 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-15 03:38:14,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-15 03:38:14,806 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-15 03:38:14,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-15 03:38:14,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-15 03:38:14,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-15 03:38:14,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-15 03:38:14,808 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-15 03:38:14,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-15 03:38:14,809 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-15 03:38:14,809 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-15 03:38:14,809 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-15 03:38:14,810 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-15 03:38:14,810 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-15 03:38:14,811 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-02-15 03:38:14,817 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-15 03:38:14,817 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-15 03:38:14,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-15 03:38:14,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-15 03:38:14,818 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-15 03:38:14,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-15 03:38:14,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-15 03:38:14,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-15 03:38:14,819 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-15 03:38:14,819 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-15 03:38:14,819 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-15 03:38:14,819 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-15 03:38:14,819 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-15 03:38:14,820 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-02-15 03:38:14,820 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-15 03:38:14,820 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 03:38:14,820 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-15 03:38:14,820 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2022-02-15 03:38:14,820 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-15 03:38:14,820 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-02-15 03:38:14,821 INFO L138 SettingsManager]: * Use separate solver for trace checks=false 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-02-15 03:38:14,996 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-15 03:38:15,013 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-15 03:38:15,015 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-15 03:38:15,016 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-15 03:38:15,016 INFO L275 PluginConnector]: CDTParser initialized [2022-02-15 03:38:15,017 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/invert_string-3.c [2022-02-15 03:38:15,081 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c93044d7/7573f09fda2641d0a94393841a93fe19/FLAG130883642 [2022-02-15 03:38:15,433 INFO L306 CDTParser]: Found 1 translation units. [2022-02-15 03:38:15,434 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c [2022-02-15 03:38:15,443 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c93044d7/7573f09fda2641d0a94393841a93fe19/FLAG130883642 [2022-02-15 03:38:15,864 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9c93044d7/7573f09fda2641d0a94393841a93fe19 [2022-02-15 03:38:15,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-15 03:38:15,867 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-02-15 03:38:15,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-15 03:38:15,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-15 03:38:15,871 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-15 03:38:15,872 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 03:38:15" (1/1) ... [2022-02-15 03:38:15,872 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ca23c5f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:15, skipping insertion in model container [2022-02-15 03:38:15,873 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.02 03:38:15" (1/1) ... [2022-02-15 03:38:15,877 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-15 03:38:15,885 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-15 03:38:15,985 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-02-15 03:38:16,025 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 03:38:16,035 INFO L203 MainTranslator]: Completed pre-run [2022-02-15 03:38:16,045 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/invert_string-3.c[327,340] [2022-02-15 03:38:16,060 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-15 03:38:16,070 INFO L208 MainTranslator]: Completed translation [2022-02-15 03:38:16,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16 WrapperNode [2022-02-15 03:38:16,071 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-15 03:38:16,072 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-15 03:38:16,072 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-15 03:38:16,072 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-15 03:38:16,080 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,080 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,084 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,085 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,088 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,090 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,091 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,092 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-15 03:38:16,093 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-15 03:38:16,093 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-15 03:38:16,093 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-15 03:38:16,096 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (1/1) ... [2022-02-15 03:38:16,101 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-15 03:38:16,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-15 03:38:16,116 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-15 03:38:16,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-15 03:38:16,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-02-15 03:38:16,139 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-15 03:38:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-02-15 03:38:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-15 03:38:16,140 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_char [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-15 03:38:16,140 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-15 03:38:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-15 03:38:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-02-15 03:38:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-15 03:38:16,141 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-15 03:38:16,181 INFO L234 CfgBuilder]: Building ICFG [2022-02-15 03:38:16,182 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-15 03:38:16,322 INFO L275 CfgBuilder]: Performing block encoding [2022-02-15 03:38:16,326 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-15 03:38:16,326 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-15 03:38:16,327 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 03:38:16 BoogieIcfgContainer [2022-02-15 03:38:16,328 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-15 03:38:16,329 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-15 03:38:16,329 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-15 03:38:16,346 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-15 03:38:16,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.02 03:38:15" (1/3) ... [2022-02-15 03:38:16,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301abf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 03:38:16, skipping insertion in model container [2022-02-15 03:38:16,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.02 03:38:16" (2/3) ... [2022-02-15 03:38:16,347 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@301abf5e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.02 03:38:16, skipping insertion in model container [2022-02-15 03:38:16,347 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.02 03:38:16" (3/3) ... [2022-02-15 03:38:16,348 INFO L111 eAbstractionObserver]: Analyzing ICFG invert_string-3.c [2022-02-15 03:38:16,351 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:AcceleratedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-02-15 03:38:16,351 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-15 03:38:16,381 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-15 03:38:16,386 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=AcceleratedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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, mLoopAccelerationTechnique=QVASR [2022-02-15 03:38:16,386 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-15 03:38:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 03:38:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-15 03:38:16,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:16,414 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:16,414 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:16,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:16,421 INFO L85 PathProgramCache]: Analyzing trace with hash 1728321422, now seen corresponding path program 1 times [2022-02-15 03:38:16,431 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:16,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [925135206] [2022-02-15 03:38:16,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:16,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:16,479 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:16,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:16,751 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:16,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:16,763 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:16,765 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:16,765 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [925135206] [2022-02-15 03:38:16,767 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [925135206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:16,767 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:16,767 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:38:16,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [662124240] [2022-02-15 03:38:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:16,772 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:38:16,772 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:16,793 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:38:16,793 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:38:16,795 INFO L87 Difference]: Start difference. First operand has 27 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:16,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:16,899 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-02-15 03:38:16,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 03:38:16,900 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 15 [2022-02-15 03:38:16,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:16,904 INFO L225 Difference]: With dead ends: 48 [2022-02-15 03:38:16,905 INFO L226 Difference]: Without dead ends: 24 [2022-02-15 03:38:16,907 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:38:16,909 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:16,910 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 35 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 03:38:16,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-15 03:38:16,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 23. [2022-02-15 03:38:16,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 17 states have (on average 1.1764705882352942) internal successors, (20), 17 states have internal predecessors, (20), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:16,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 25 transitions. [2022-02-15 03:38:16,936 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 25 transitions. Word has length 15 [2022-02-15 03:38:16,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:16,936 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 25 transitions. [2022-02-15 03:38:16,937 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:16,937 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 25 transitions. [2022-02-15 03:38:16,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-15 03:38:16,937 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:16,937 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:16,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-15 03:38:16,938 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:16,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:16,938 INFO L85 PathProgramCache]: Analyzing trace with hash -1238871028, now seen corresponding path program 1 times [2022-02-15 03:38:16,938 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:16,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1774425316] [2022-02-15 03:38:16,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:16,946 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:16,946 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:16,948 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:16,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,046 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:17,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,055 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:17,055 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:17,056 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1774425316] [2022-02-15 03:38:17,056 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1774425316] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:17,056 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:17,056 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-15 03:38:17,056 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [19730263] [2022-02-15 03:38:17,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:17,057 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-15 03:38:17,058 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:17,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-15 03:38:17,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-15 03:38:17,060 INFO L87 Difference]: Start difference. First operand 23 states and 25 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:17,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:17,125 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-02-15 03:38:17,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-15 03:38:17,126 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-15 03:38:17,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:17,127 INFO L225 Difference]: With dead ends: 40 [2022-02-15 03:38:17,128 INFO L226 Difference]: Without dead ends: 25 [2022-02-15 03:38:17,131 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:38:17,133 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 19 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:17,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 28 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 03:38:17,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-02-15 03:38:17,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2022-02-15 03:38:17,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 18 states have (on average 1.1666666666666667) internal successors, (21), 18 states have internal predecessors, (21), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:17,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 26 transitions. [2022-02-15 03:38:17,149 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 26 transitions. Word has length 17 [2022-02-15 03:38:17,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:17,150 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 26 transitions. [2022-02-15 03:38:17,150 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 3 states have internal predecessors, (13), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:17,150 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 26 transitions. [2022-02-15 03:38:17,150 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-15 03:38:17,150 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:17,151 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:17,151 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-15 03:38:17,151 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:17,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:17,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1304082102, now seen corresponding path program 1 times [2022-02-15 03:38:17,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:17,153 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1337683303] [2022-02-15 03:38:17,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:17,156 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:17,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:17,157 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:17,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,318 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:17,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:17,330 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:17,330 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1337683303] [2022-02-15 03:38:17,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1337683303] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:17,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:17,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-15 03:38:17,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1553281848] [2022-02-15 03:38:17,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:17,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-15 03:38:17,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:17,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-15 03:38:17,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-15 03:38:17,333 INFO L87 Difference]: Start difference. First operand 24 states and 26 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:17,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:17,414 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-02-15 03:38:17,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-15 03:38:17,414 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 19 [2022-02-15 03:38:17,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:17,416 INFO L225 Difference]: With dead ends: 42 [2022-02-15 03:38:17,416 INFO L226 Difference]: Without dead ends: 27 [2022-02-15 03:38:17,417 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:38:17,422 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 21 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:17,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 03:38:17,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-02-15 03:38:17,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-02-15 03:38:17,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 20 states have (on average 1.15) internal successors, (23), 20 states have internal predecessors, (23), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:17,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-02-15 03:38:17,439 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 19 [2022-02-15 03:38:17,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:17,439 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-02-15 03:38:17,439 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 4 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:17,439 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-02-15 03:38:17,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-15 03:38:17,440 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:17,440 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:17,440 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-15 03:38:17,440 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:17,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:17,441 INFO L85 PathProgramCache]: Analyzing trace with hash 452585224, now seen corresponding path program 2 times [2022-02-15 03:38:17,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:17,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1687039567] [2022-02-15 03:38:17,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:17,443 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:17,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:17,447 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:17,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,579 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:17,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:17,601 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:17,601 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1687039567] [2022-02-15 03:38:17,601 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1687039567] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:17,601 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:17,601 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:38:17,601 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11404518] [2022-02-15 03:38:17,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:17,602 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:38:17,602 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:17,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:38:17,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:38:17,603 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:17,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:17,718 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-15 03:38:17,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 03:38:17,718 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 21 [2022-02-15 03:38:17,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:17,720 INFO L225 Difference]: With dead ends: 44 [2022-02-15 03:38:17,720 INFO L226 Difference]: Without dead ends: 29 [2022-02-15 03:38:17,721 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-15 03:38:17,725 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 23 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:17,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 38 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:17,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-15 03:38:17,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 28. [2022-02-15 03:38:17,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 22 states have internal predecessors, (25), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:17,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-02-15 03:38:17,742 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 21 [2022-02-15 03:38:17,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:17,742 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-02-15 03:38:17,742 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:17,742 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-02-15 03:38:17,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-15 03:38:17,743 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:17,743 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:17,743 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-15 03:38:17,744 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:17,744 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:17,744 INFO L85 PathProgramCache]: Analyzing trace with hash 687738182, now seen corresponding path program 3 times [2022-02-15 03:38:17,744 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:17,744 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [148148457] [2022-02-15 03:38:17,745 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:17,747 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:17,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:17,748 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:17,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,876 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:17,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:17,882 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:17,882 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:17,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [148148457] [2022-02-15 03:38:17,882 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [148148457] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:17,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:17,883 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-15 03:38:17,883 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125871779] [2022-02-15 03:38:17,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:17,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-15 03:38:17,884 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:17,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-15 03:38:17,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-02-15 03:38:17,884 INFO L87 Difference]: Start difference. First operand 28 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:18,011 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-02-15 03:38:18,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-15 03:38:18,012 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-15 03:38:18,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:18,013 INFO L225 Difference]: With dead ends: 46 [2022-02-15 03:38:18,013 INFO L226 Difference]: Without dead ends: 31 [2022-02-15 03:38:18,013 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2022-02-15 03:38:18,014 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:18,014 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 38 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:18,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-15 03:38:18,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2022-02-15 03:38:18,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 24 states have (on average 1.125) internal successors, (27), 24 states have internal predecessors, (27), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:18,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 32 transitions. [2022-02-15 03:38:18,030 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 32 transitions. Word has length 23 [2022-02-15 03:38:18,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:18,031 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 32 transitions. [2022-02-15 03:38:18,031 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,032 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2022-02-15 03:38:18,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-15 03:38:18,033 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:18,033 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:18,033 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-15 03:38:18,033 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:18,034 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:18,034 INFO L85 PathProgramCache]: Analyzing trace with hash -963535868, now seen corresponding path program 4 times [2022-02-15 03:38:18,034 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:18,034 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1785470273] [2022-02-15 03:38:18,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:18,037 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:18,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:18,038 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:18,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:18,204 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:18,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:18,210 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:18,210 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:18,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1785470273] [2022-02-15 03:38:18,211 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1785470273] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:18,211 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:18,211 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 03:38:18,211 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [233840418] [2022-02-15 03:38:18,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:18,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 03:38:18,211 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:18,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 03:38:18,212 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:38:18,212 INFO L87 Difference]: Start difference. First operand 30 states and 32 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:18,342 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-02-15 03:38:18,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 03:38:18,342 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-15 03:38:18,343 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:18,344 INFO L225 Difference]: With dead ends: 48 [2022-02-15 03:38:18,344 INFO L226 Difference]: Without dead ends: 33 [2022-02-15 03:38:18,344 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=111, Unknown=0, NotChecked=0, Total=156 [2022-02-15 03:38:18,345 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:18,345 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 28 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:18,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-02-15 03:38:18,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-02-15 03:38:18,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:18,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-02-15 03:38:18,356 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 25 [2022-02-15 03:38:18,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:18,356 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-02-15 03:38:18,356 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,356 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-02-15 03:38:18,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-15 03:38:18,357 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:18,357 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:18,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-15 03:38:18,357 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:18,357 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:18,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1300001602, now seen corresponding path program 5 times [2022-02-15 03:38:18,358 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:18,358 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [10076123] [2022-02-15 03:38:18,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:18,361 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:18,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:18,362 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:18,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:18,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:18,513 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:18,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [10076123] [2022-02-15 03:38:18,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [10076123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:18,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:18,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-15 03:38:18,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66978935] [2022-02-15 03:38:18,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:18,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-15 03:38:18,513 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:18,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-15 03:38:18,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-15 03:38:18,514 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:18,594 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2022-02-15 03:38:18,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-15 03:38:18,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 27 [2022-02-15 03:38:18,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:18,595 INFO L225 Difference]: With dead ends: 46 [2022-02-15 03:38:18,595 INFO L226 Difference]: Without dead ends: 35 [2022-02-15 03:38:18,596 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-15 03:38:18,596 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 31 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:18,597 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 28 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-15 03:38:18,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-02-15 03:38:18,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-02-15 03:38:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 28 states have (on average 1.1071428571428572) internal successors, (31), 28 states have internal predecessors, (31), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:18,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 36 transitions. [2022-02-15 03:38:18,604 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 36 transitions. Word has length 27 [2022-02-15 03:38:18,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:18,604 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 36 transitions. [2022-02-15 03:38:18,604 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,604 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 36 transitions. [2022-02-15 03:38:18,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-15 03:38:18,604 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:18,604 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:18,605 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-15 03:38:18,605 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:18,605 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:18,605 INFO L85 PathProgramCache]: Analyzing trace with hash -537357632, now seen corresponding path program 6 times [2022-02-15 03:38:18,605 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:18,605 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [204348548] [2022-02-15 03:38:18,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:18,606 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:18,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:18,607 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:18,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:18,750 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:18,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:18,755 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:18,755 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:18,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [204348548] [2022-02-15 03:38:18,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [204348548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:18,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:18,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-15 03:38:18,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2137909558] [2022-02-15 03:38:18,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:18,756 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-15 03:38:18,756 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:18,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-15 03:38:18,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-15 03:38:18,759 INFO L87 Difference]: Start difference. First operand 34 states and 36 transitions. Second operand has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:18,942 INFO L93 Difference]: Finished difference Result 48 states and 51 transitions. [2022-02-15 03:38:18,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-15 03:38:18,942 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-15 03:38:18,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:18,943 INFO L225 Difference]: With dead ends: 48 [2022-02-15 03:38:18,943 INFO L226 Difference]: Without dead ends: 37 [2022-02-15 03:38:18,943 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=104, Unknown=0, NotChecked=0, Total=156 [2022-02-15 03:38:18,943 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 34 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:18,944 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 43 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:18,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-15 03:38:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-02-15 03:38:18,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 30 states have (on average 1.1) internal successors, (33), 30 states have internal predecessors, (33), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:18,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 38 transitions. [2022-02-15 03:38:18,950 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 38 transitions. Word has length 29 [2022-02-15 03:38:18,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:18,951 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 38 transitions. [2022-02-15 03:38:18,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.125) internal successors, (17), 7 states have internal predecessors, (17), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:18,951 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 38 transitions. [2022-02-15 03:38:18,951 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-15 03:38:18,951 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:18,951 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:18,952 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-15 03:38:18,952 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:18,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:18,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1008022850, now seen corresponding path program 7 times [2022-02-15 03:38:18,952 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:18,952 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [80449116] [2022-02-15 03:38:18,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:18,953 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:18,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:18,954 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:18,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:19,132 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:19,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:19,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:19,136 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:19,136 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [80449116] [2022-02-15 03:38:19,136 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [80449116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:19,136 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:19,136 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-15 03:38:19,136 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27393911] [2022-02-15 03:38:19,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:19,137 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-15 03:38:19,137 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:19,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-15 03:38:19,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-15 03:38:19,137 INFO L87 Difference]: Start difference. First operand 36 states and 38 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:19,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:19,365 INFO L93 Difference]: Finished difference Result 50 states and 53 transitions. [2022-02-15 03:38:19,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-15 03:38:19,366 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-15 03:38:19,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:19,366 INFO L225 Difference]: With dead ends: 50 [2022-02-15 03:38:19,366 INFO L226 Difference]: Without dead ends: 39 [2022-02-15 03:38:19,367 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=143, Unknown=0, NotChecked=0, Total=210 [2022-02-15 03:38:19,367 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 38 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:19,367 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 43 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:19,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-15 03:38:19,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 38. [2022-02-15 03:38:19,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.09375) internal successors, (35), 32 states have internal predecessors, (35), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:19,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 40 transitions. [2022-02-15 03:38:19,374 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 40 transitions. Word has length 31 [2022-02-15 03:38:19,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:19,375 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 40 transitions. [2022-02-15 03:38:19,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:19,375 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 40 transitions. [2022-02-15 03:38:19,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-15 03:38:19,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:19,375 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:19,376 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-15 03:38:19,376 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:19,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:19,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1949236028, now seen corresponding path program 8 times [2022-02-15 03:38:19,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:19,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1808744822] [2022-02-15 03:38:19,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:19,377 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:19,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:19,378 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:19,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:19,546 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:19,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:19,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:19,551 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:19,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1808744822] [2022-02-15 03:38:19,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1808744822] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:19,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:19,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 03:38:19,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678510822] [2022-02-15 03:38:19,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:19,552 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 03:38:19,552 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:19,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 03:38:19,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:38:19,552 INFO L87 Difference]: Start difference. First operand 38 states and 40 transitions. Second operand has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:19,857 INFO L93 Difference]: Finished difference Result 63 states and 69 transitions. [2022-02-15 03:38:19,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 03:38:19,857 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-15 03:38:19,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:19,859 INFO L225 Difference]: With dead ends: 63 [2022-02-15 03:38:19,859 INFO L226 Difference]: Without dead ends: 52 [2022-02-15 03:38:19,859 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=188, Unknown=0, NotChecked=0, Total=272 [2022-02-15 03:38:19,860 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 50 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:19,860 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 57 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:19,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-02-15 03:38:19,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 40. [2022-02-15 03:38:19,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.088235294117647) internal successors, (37), 34 states have internal predecessors, (37), 3 states have call successors, (3), 3 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:19,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 42 transitions. [2022-02-15 03:38:19,874 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 42 transitions. Word has length 33 [2022-02-15 03:38:19,875 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:19,875 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 42 transitions. [2022-02-15 03:38:19,876 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:19,876 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 42 transitions. [2022-02-15 03:38:19,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-15 03:38:19,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:19,878 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:19,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-15 03:38:19,879 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:19,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:19,879 INFO L85 PathProgramCache]: Analyzing trace with hash 606667834, now seen corresponding path program 9 times [2022-02-15 03:38:19,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:19,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1218777235] [2022-02-15 03:38:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:19,882 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:19,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:19,883 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:19,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:20,678 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:20,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:20,682 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:20,682 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:20,682 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1218777235] [2022-02-15 03:38:20,682 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1218777235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:20,682 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:20,682 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-02-15 03:38:20,682 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354270865] [2022-02-15 03:38:20,682 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:20,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-02-15 03:38:20,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:20,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-02-15 03:38:20,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2022-02-15 03:38:20,683 INFO L87 Difference]: Start difference. First operand 40 states and 42 transitions. Second operand has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:22,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:22,046 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-02-15 03:38:22,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-02-15 03:38:22,047 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 35 [2022-02-15 03:38:22,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:22,047 INFO L225 Difference]: With dead ends: 70 [2022-02-15 03:38:22,048 INFO L226 Difference]: Without dead ends: 68 [2022-02-15 03:38:22,048 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 3 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 448 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=361, Invalid=1801, Unknown=0, NotChecked=0, Total=2162 [2022-02-15 03:38:22,049 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 84 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 119 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 119 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:22,049 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 73 Invalid, 715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [119 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 03:38:22,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-15 03:38:22,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 46. [2022-02-15 03:38:22,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 38 states have (on average 1.0789473684210527) internal successors, (41), 39 states have internal predecessors, (41), 4 states have call successors, (4), 4 states have call predecessors, (4), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 03:38:22,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 48 transitions. [2022-02-15 03:38:22,063 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 48 transitions. Word has length 35 [2022-02-15 03:38:22,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:22,063 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 48 transitions. [2022-02-15 03:38:22,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.4) internal successors, (28), 19 states have internal predecessors, (28), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-15 03:38:22,063 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 48 transitions. [2022-02-15 03:38:22,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-15 03:38:22,064 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:22,064 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:22,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-15 03:38:22,064 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:22,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:22,065 INFO L85 PathProgramCache]: Analyzing trace with hash 758259348, now seen corresponding path program 1 times [2022-02-15 03:38:22,065 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:22,065 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2068300797] [2022-02-15 03:38:22,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:22,066 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:22,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:22,067 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:22,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:23,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:23,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:23,125 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-15 03:38:23,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:23,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:23,129 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:23,130 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2068300797] [2022-02-15 03:38:23,130 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [2068300797] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:23,130 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:23,130 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-02-15 03:38:23,130 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201475424] [2022-02-15 03:38:23,130 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:23,130 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-15 03:38:23,130 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:23,131 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-15 03:38:23,131 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=429, Unknown=0, NotChecked=0, Total=506 [2022-02-15 03:38:23,131 INFO L87 Difference]: Start difference. First operand 46 states and 48 transitions. Second operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:24,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:24,681 INFO L93 Difference]: Finished difference Result 72 states and 78 transitions. [2022-02-15 03:38:24,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-02-15 03:38:24,682 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 43 [2022-02-15 03:38:24,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:24,682 INFO L225 Difference]: With dead ends: 72 [2022-02-15 03:38:24,683 INFO L226 Difference]: Without dead ends: 70 [2022-02-15 03:38:24,683 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 592 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=373, Invalid=2177, Unknown=0, NotChecked=0, Total=2550 [2022-02-15 03:38:24,684 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 50 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 667 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 802 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 667 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:24,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 96 Invalid, 802 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 667 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 03:38:24,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-15 03:38:24,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 59. [2022-02-15 03:38:24,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 48 states have (on average 1.0833333333333333) internal successors, (52), 50 states have internal predecessors, (52), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 03:38:24,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 63 transitions. [2022-02-15 03:38:24,710 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 63 transitions. Word has length 43 [2022-02-15 03:38:24,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:24,711 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 63 transitions. [2022-02-15 03:38:24,712 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 21 states have internal predecessors, (31), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:24,712 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 63 transitions. [2022-02-15 03:38:24,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-15 03:38:24,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:24,715 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:24,715 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-15 03:38:24,715 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:24,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:24,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1926528494, now seen corresponding path program 2 times [2022-02-15 03:38:24,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:24,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1520644617] [2022-02-15 03:38:24,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:24,717 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:24,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:24,719 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:24,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:24,855 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:24,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:24,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2022-02-15 03:38:24,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:24,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:24,866 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:24,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1520644617] [2022-02-15 03:38:24,867 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1520644617] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:24,867 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:24,867 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 03:38:24,867 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855552466] [2022-02-15 03:38:24,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:24,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 03:38:24,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:24,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 03:38:24,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:38:24,868 INFO L87 Difference]: Start difference. First operand 59 states and 63 transitions. Second operand has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:25,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:25,087 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2022-02-15 03:38:25,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-15 03:38:25,087 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 45 [2022-02-15 03:38:25,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:25,088 INFO L225 Difference]: With dead ends: 83 [2022-02-15 03:38:25,089 INFO L226 Difference]: Without dead ends: 64 [2022-02-15 03:38:25,089 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2022-02-15 03:38:25,090 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 64 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:25,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 35 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:25,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-15 03:38:25,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 54. [2022-02-15 03:38:25,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 44 states have (on average 1.0454545454545454) internal successors, (46), 45 states have internal predecessors, (46), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 03:38:25,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2022-02-15 03:38:25,114 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 45 [2022-02-15 03:38:25,114 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:25,114 INFO L470 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2022-02-15 03:38:25,114 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.0) internal successors, (30), 9 states have internal predecessors, (30), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-15 03:38:25,114 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2022-02-15 03:38:25,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-15 03:38:25,114 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:25,115 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:25,115 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-15 03:38:25,115 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:25,115 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:25,115 INFO L85 PathProgramCache]: Analyzing trace with hash 814759662, now seen corresponding path program 3 times [2022-02-15 03:38:25,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:25,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1669856173] [2022-02-15 03:38:25,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:25,117 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:25,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:25,118 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:25,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:26,285 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:26,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:26,289 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-15 03:38:26,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:26,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-15 03:38:26,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:26,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:26,298 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:26,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1669856173] [2022-02-15 03:38:26,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [1669856173] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:26,298 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:26,298 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [26] imperfect sequences [] total 26 [2022-02-15 03:38:26,298 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1816461143] [2022-02-15 03:38:26,298 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:26,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-02-15 03:38:26,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:26,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-02-15 03:38:26,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2022-02-15 03:38:26,300 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 26 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 03:38:27,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:27,646 INFO L93 Difference]: Finished difference Result 65 states and 66 transitions. [2022-02-15 03:38:27,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-15 03:38:27,647 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-02-15 03:38:27,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:27,647 INFO L225 Difference]: With dead ends: 65 [2022-02-15 03:38:27,648 INFO L226 Difference]: Without dead ends: 63 [2022-02-15 03:38:27,648 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 477 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=300, Invalid=2052, Unknown=0, NotChecked=0, Total=2352 [2022-02-15 03:38:27,649 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 52 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 550 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 550 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:27,649 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 42 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 550 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-15 03:38:27,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-15 03:38:27,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-02-15 03:38:27,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 50 states have (on average 1.04) internal successors, (52), 51 states have internal predecessors, (52), 6 states have call successors, (6), 6 states have call predecessors, (6), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 03:38:27,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 63 transitions. [2022-02-15 03:38:27,669 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 63 transitions. Word has length 51 [2022-02-15 03:38:27,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:27,670 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 63 transitions. [2022-02-15 03:38:27,670 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.44) internal successors, (36), 24 states have internal predecessors, (36), 4 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-15 03:38:27,670 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 63 transitions. [2022-02-15 03:38:27,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-02-15 03:38:27,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:27,671 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:27,671 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-15 03:38:27,671 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:27,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:27,672 INFO L85 PathProgramCache]: Analyzing trace with hash -1545771704, now seen corresponding path program 4 times [2022-02-15 03:38:27,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:27,672 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [518990715] [2022-02-15 03:38:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:27,675 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:27,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:27,677 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:27,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:28,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:28,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:28,791 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-15 03:38:28,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:28,794 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-15 03:38:28,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:28,796 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-15 03:38:28,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:28,800 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:28,800 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:28,800 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [518990715] [2022-02-15 03:38:28,800 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [518990715] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:28,800 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:28,800 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [28] imperfect sequences [] total 28 [2022-02-15 03:38:28,800 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053697651] [2022-02-15 03:38:28,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:28,800 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2022-02-15 03:38:28,800 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:28,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2022-02-15 03:38:28,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=609, Unknown=0, NotChecked=0, Total=756 [2022-02-15 03:38:28,801 INFO L87 Difference]: Start difference. First operand 62 states and 63 transitions. Second operand has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 03:38:30,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:30,973 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2022-02-15 03:38:30,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-02-15 03:38:30,974 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 59 [2022-02-15 03:38:30,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:30,975 INFO L225 Difference]: With dead ends: 81 [2022-02-15 03:38:30,975 INFO L226 Difference]: Without dead ends: 79 [2022-02-15 03:38:30,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1153 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=724, Invalid=3308, Unknown=0, NotChecked=0, Total=4032 [2022-02-15 03:38:30,978 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 92 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 652 mSolverCounterSat, 280 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 932 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 280 IncrementalHoareTripleChecker+Valid, 652 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:30,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 72 Invalid, 932 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [280 Valid, 652 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-15 03:38:30,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-15 03:38:30,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-02-15 03:38:31,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 56 states have (on average 1.0357142857142858) internal successors, (58), 57 states have internal predecessors, (58), 7 states have call successors, (7), 7 states have call predecessors, (7), 6 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-15 03:38:31,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 71 transitions. [2022-02-15 03:38:31,001 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 71 transitions. Word has length 59 [2022-02-15 03:38:31,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:31,001 INFO L470 AbstractCegarLoop]: Abstraction has 70 states and 71 transitions. [2022-02-15 03:38:31,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 26 states have internal predecessors, (39), 5 states have call successors, (6), 3 states have call predecessors, (6), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-15 03:38:31,001 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 71 transitions. [2022-02-15 03:38:31,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-15 03:38:31,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:31,002 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:31,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-15 03:38:31,002 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:31,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:31,002 INFO L85 PathProgramCache]: Analyzing trace with hash -1028419166, now seen corresponding path program 5 times [2022-02-15 03:38:31,002 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:31,002 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [626291652] [2022-02-15 03:38:31,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:31,004 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:31,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:31,005 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:31,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:32,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:32,221 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-15 03:38:32,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:32,224 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-15 03:38:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:32,226 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-15 03:38:32,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:32,228 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 03:38:32,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:32,231 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:32,231 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:32,231 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [626291652] [2022-02-15 03:38:32,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [626291652] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:32,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:32,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [33] imperfect sequences [] total 33 [2022-02-15 03:38:32,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367477205] [2022-02-15 03:38:32,232 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:32,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2022-02-15 03:38:32,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:32,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2022-02-15 03:38:32,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=155, Invalid=901, Unknown=0, NotChecked=0, Total=1056 [2022-02-15 03:38:32,233 INFO L87 Difference]: Start difference. First operand 70 states and 71 transitions. Second operand has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 03:38:35,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:35,974 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2022-02-15 03:38:35,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2022-02-15 03:38:35,974 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 67 [2022-02-15 03:38:35,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:35,975 INFO L225 Difference]: With dead ends: 104 [2022-02-15 03:38:35,975 INFO L226 Difference]: Without dead ends: 102 [2022-02-15 03:38:35,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1661 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=1177, Invalid=5465, Unknown=0, NotChecked=0, Total=6642 [2022-02-15 03:38:35,977 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 139 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 1191 mSolverCounterSat, 328 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 139 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 1519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 328 IncrementalHoareTripleChecker+Valid, 1191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:35,977 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [139 Valid, 108 Invalid, 1519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [328 Valid, 1191 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-15 03:38:35,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-15 03:38:36,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2022-02-15 03:38:36,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 62 states have (on average 1.032258064516129) internal successors, (64), 63 states have internal predecessors, (64), 8 states have call successors, (8), 8 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-02-15 03:38:36,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 79 transitions. [2022-02-15 03:38:36,009 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 79 transitions. Word has length 67 [2022-02-15 03:38:36,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:36,009 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 79 transitions. [2022-02-15 03:38:36,009 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 32 states have (on average 1.4375) internal successors, (46), 31 states have internal predecessors, (46), 6 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-02-15 03:38:36,009 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 79 transitions. [2022-02-15 03:38:36,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-02-15 03:38:36,010 INFO L506 BasicCegarLoop]: Found error trace [2022-02-15 03:38:36,010 INFO L514 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-15 03:38:36,010 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-15 03:38:36,010 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-15 03:38:36,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-15 03:38:36,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1901280260, now seen corresponding path program 6 times [2022-02-15 03:38:36,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2022-02-15 03:38:36,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100433499] [2022-02-15 03:38:36,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-15 03:38:36,012 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Qvasr do not support arrays. [2022-02-15 03:38:36,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-15 03:38:36,013 INFO L274 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-02-15 03:38:36,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-02-15 03:38:36,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:36,147 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2022-02-15 03:38:36,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:36,153 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2022-02-15 03:38:36,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:36,155 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2022-02-15 03:38:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:36,157 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 55 [2022-02-15 03:38:36,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:36,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2022-02-15 03:38:36,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-15 03:38:36,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-15 03:38:36,162 INFO L144 FreeRefinementEngine]: Strategy FIXED_PREFERENCES found an infeasible trace [2022-02-15 03:38:36,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100433499] [2022-02-15 03:38:36,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModulePreferences [100433499] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-15 03:38:36,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-15 03:38:36,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-15 03:38:36,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [836928142] [2022-02-15 03:38:36,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-15 03:38:36,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-15 03:38:36,163 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2022-02-15 03:38:36,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-15 03:38:36,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2022-02-15 03:38:36,163 INFO L87 Difference]: Start difference. First operand 78 states and 79 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-15 03:38:36,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-15 03:38:36,490 INFO L93 Difference]: Finished difference Result 134 states and 136 transitions. [2022-02-15 03:38:36,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-15 03:38:36,491 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 75 [2022-02-15 03:38:36,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-15 03:38:36,491 INFO L225 Difference]: With dead ends: 134 [2022-02-15 03:38:36,491 INFO L226 Difference]: Without dead ends: 0 [2022-02-15 03:38:36,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-02-15 03:38:36,492 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 46 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-15 03:38:36,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 52 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-15 03:38:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-15 03:38:36,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-15 03:38:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-15 03:38:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-15 03:38:36,493 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 75 [2022-02-15 03:38:36,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-15 03:38:36,493 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-15 03:38:36,493 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 9 states have internal predecessors, (33), 7 states have call successors, (8), 3 states have call predecessors, (8), 1 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-02-15 03:38:36,493 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-15 03:38:36,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-15 03:38:36,495 INFO L764 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-15 03:38:36,495 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-15 03:38:36,497 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-15 03:38:48,495 INFO L858 garLoopResultBuilder]: For program point reach_errorEXIT(line 3) no Hoare annotation was computed. [2022-02-15 03:38:48,496 INFO L858 garLoopResultBuilder]: For program point reach_errorENTRY(line 3) no Hoare annotation was computed. [2022-02-15 03:38:48,496 INFO L858 garLoopResultBuilder]: For program point reach_errorFINAL(line 3) no Hoare annotation was computed. [2022-02-15 03:38:48,496 INFO L854 garLoopResultBuilder]: At program point L33(line 33) the Hoare annotation is: (let ((.cse17 (+ main_~max~0 4294967295))) (let ((.cse24 (div .cse17 4294967296))) (let ((.cse21 (* .cse24 4294967296)) (.cse10 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse18 (select .cse10 (+ (* .cse24 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (.cse15 (+ main_~i~0 .cse21)) (.cse14 (+ main_~i~0 |main_~#str1~0.offset|)) (.cse23 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse7 (= |main_~#str2~0.offset| 0)) (.cse8 (<= 5 main_~max~0)) (.cse9 (<= main_~max~0 5)) (.cse19 (= (select .cse10 3) (select .cse23 1))) (.cse12 (or (not (= .cse14 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse21)))) (.cse20 (= |main_~#str1~0.offset| 0)) (.cse13 (<= 4294967296 .cse15)) (.cse16 (= (select .cse23 0) .cse18))) (let ((.cse11 (select .cse23 .cse14)) (.cse0 (= (select .cse23 3) (select .cse10 1))) (.cse1 (= (select .cse10 2) (select .cse23 2))) (.cse2 (= |main_#t~mem11| |main_#t~mem10|)) (.cse3 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse4 (or (and .cse7 (<= 1 .cse14) .cse8 .cse9 .cse12 .cse20 .cse13 .cse16) (and .cse7 .cse8 .cse9 .cse19 .cse12 .cse20 .cse13 .cse16))) (.cse5 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse6 (= (select .cse10 0) (select .cse23 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 (<= 1 .cse3) .cse4 .cse5 (<= main_~j~0 1) (<= 3 main_~i~0) (<= main_~i~0 3) .cse6) (and .cse7 .cse8 .cse9 (= (select .cse10 .cse3) .cse11) .cse12 .cse0 .cse1 .cse2 .cse13 (= .cse14 1) (<= 3 main_~j~0) .cse5 (<= .cse15 4294967297) (<= 1 main_~i~0) .cse16 (<= main_~j~0 3) .cse6) (and .cse0 .cse1 .cse2 (= main_~j~0 0) (= .cse17 .cse15) .cse4 .cse5 .cse6) (and .cse7 (= .cse18 .cse11) .cse8 .cse9 .cse19 .cse0 .cse20 .cse1 .cse2 .cse13 (= main_~i~0 0) .cse5 (= .cse17 (+ main_~i~0 main_~j~0 .cse21)) .cse6) (let ((.cse22 (+ main_~max~0 4294967293))) (and .cse0 .cse1 (<= main_~j~0 2) .cse2 (<= 2 .cse3) .cse4 .cse5 (<= .cse22 .cse15) .cse6 (<= .cse15 .cse22)))))))))) [2022-02-15 03:38:48,496 INFO L854 garLoopResultBuilder]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse16 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse17 (* .cse16 4294967296))) (let ((.cse12 (+ main_~i~0 .cse17)) (.cse14 (select |#memory_int| |main_~#str1~0.base|)) (.cse13 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (or (not (= (+ main_~i~0 |main_~#str1~0.offset|) 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse17)))) (.cse4 (= (select .cse14 3) (select .cse13 1))) (.cse5 (= |main_~#str1~0.offset| 0)) (.cse6 (= (select .cse13 2) (select .cse14 2))) (.cse7 (<= 4294967296 .cse12)) (.cse8 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse9 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse10 (= (select .cse14 0) (select .cse13 (+ (* .cse16 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (.cse11 (= (select .cse13 0) (select .cse14 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 .cse8) .cse9 (<= main_~j~0 1) (<= 3 main_~i~0) .cse10 (<= main_~i~0 3) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 (<= 3 main_~j~0) .cse9 (<= .cse12 (+ 4294967292 main_~max~0)) .cse10 (<= main_~j~0 3) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 .cse7 .cse9 .cse10 (<= main_~i~0 (+ 4294967291 (* (div main_~max~0 4294967296) 4294967296))) .cse11 (<= main_~max~0 (+ main_~i~0 1))) (and .cse0 .cse1 .cse2 (= (select .cse13 3) (select .cse14 1)) .cse3 .cse4 .cse5 .cse6 .cse7 (= main_~i~0 0) .cse9 .cse10 .cse11) (let ((.cse15 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6 (<= main_~j~0 2) .cse7 (<= 2 .cse8) .cse9 .cse10 (<= .cse15 .cse12) .cse11 (<= .cse12 .cse15)))))))) [2022-02-15 03:38:48,496 INFO L854 garLoopResultBuilder]: At program point mainEXIT(lines 13 36) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-02-15 03:38:48,496 INFO L854 garLoopResultBuilder]: At program point mainFINAL(lines 13 36) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-02-15 03:38:48,497 INFO L854 garLoopResultBuilder]: At program point L32-2(lines 32 35) the Hoare annotation is: (let ((.cse13 (select |#memory_int| |main_~#str1~0.base|)) (.cse16 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse9 (+ main_~i~0 (* .cse16 4294967296))) (.cse6 (select .cse13 2)) (.cse14 (select .cse13 3)) (.cse15 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse7 (select .cse15 (+ main_~j~0 |main_~#str2~0.offset|))) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (= .cse14 (select .cse15 1))) (.cse4 (= |main_~#str1~0.offset| 0)) (.cse12 (= (select .cse15 2) .cse6)) (.cse5 (<= 4294967296 .cse9)) (.cse8 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse10 (= (select .cse13 0) (select .cse15 (+ (* .cse16 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)))) (.cse11 (= (select .cse15 0) (select .cse13 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~j~0 2) .cse5 (= .cse6 .cse7) (<= 2 main_~j~0) .cse8 (<= .cse9 (+ 4294967292 main_~max~0)) (<= 1 main_~i~0) .cse10 .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 (= (select .cse13 1) .cse7) (<= 3 main_~j~0) .cse8 (<= .cse9 (+ 4294967291 main_~max~0)) .cse10 (<= main_~j~0 3) .cse11) (and .cse0 .cse1 .cse2 (<= 1 main_~j~0) .cse4 .cse12 (<= main_~max~0 (+ main_~i~0 3)) .cse5 .cse8 (<= main_~i~0 2) (<= main_~j~0 1) .cse10 (= .cse14 .cse7) .cse11) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 .cse5 .cse8 .cse10 (<= main_~i~0 (+ 4294967291 (* (div main_~max~0 4294967296) 4294967296))) .cse11 (<= main_~max~0 (+ main_~i~0 1))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse12 (= main_~j~0 0) .cse5 .cse8 (<= 3 main_~i~0) .cse10 (<= main_~i~0 3) .cse11))))) [2022-02-15 03:38:48,497 INFO L861 garLoopResultBuilder]: At program point mainENTRY(lines 13 36) the Hoare annotation is: true [2022-02-15 03:38:48,497 INFO L854 garLoopResultBuilder]: At program point L32-3(lines 32 35) the Hoare annotation is: (let ((.cse2 (+ main_~max~0 4294967295))) (let ((.cse23 (div .cse2 4294967296))) (let ((.cse17 (* .cse23 4294967296)) (.cse18 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse10 (select .cse18 (+ (* .cse23 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (.cse3 (+ main_~i~0 .cse17)) (.cse20 (+ main_~i~0 |main_~#str1~0.offset|)) (.cse22 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse9 (= |main_~#str2~0.offset| 0)) (.cse12 (<= 5 main_~max~0)) (.cse13 (<= main_~max~0 5)) (.cse14 (= (select .cse18 3) (select .cse22 1))) (.cse19 (or (not (= .cse20 0)) (= (+ main_~max~0 4294967295 |main_~#str1~0.offset|) (+ main_~i~0 main_~j~0 |main_~#str2~0.offset| .cse17)))) (.cse15 (= |main_~#str1~0.offset| 0)) (.cse16 (<= 4294967296 .cse3)) (.cse21 (= (select .cse22 0) .cse10))) (let ((.cse4 (or (and .cse9 (<= 1 .cse20) .cse12 .cse13 .cse19 .cse15 .cse16 .cse21) (and .cse9 .cse12 .cse13 .cse14 .cse19 .cse15 .cse16 .cse21))) (.cse7 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse11 (select .cse22 .cse20)) (.cse0 (= (select .cse22 3) (select .cse18 1))) (.cse1 (= (select .cse18 2) (select .cse22 2))) (.cse5 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse6 (= (select .cse18 0) (select .cse22 (+ |main_~#str1~0.offset| 4))))) (or (and .cse0 .cse1 (= main_~j~0 0) (= .cse2 .cse3) .cse4 .cse5 .cse6) (and .cse0 .cse1 (<= main_~i~0 (+ 4294967292 (* (div main_~max~0 4294967296) 4294967296))) .cse4 .cse5 (<= main_~max~0 main_~i~0) .cse6) (and .cse0 .cse1 (<= 1 .cse7) .cse4 .cse5 (<= main_~j~0 1) (<= 3 main_~i~0) (<= main_~i~0 3) .cse6) (let ((.cse8 (+ main_~max~0 4294967293))) (and .cse0 .cse1 (<= main_~j~0 2) (<= 2 .cse7) .cse4 .cse5 (<= .cse8 .cse3) .cse6 (<= .cse3 .cse8))) (and .cse9 (= .cse10 .cse11) .cse12 .cse13 .cse14 .cse0 .cse15 .cse1 .cse16 (= main_~i~0 0) .cse5 (= .cse2 (+ main_~i~0 main_~j~0 .cse17)) .cse6) (and .cse9 .cse12 .cse13 (= (select .cse18 .cse7) .cse11) .cse19 .cse0 .cse1 .cse16 (= .cse20 1) (<= 3 main_~j~0) .cse5 (<= .cse3 4294967297) (<= 1 main_~i~0) .cse21 (<= main_~j~0 3) .cse6)))))))) [2022-02-15 03:38:48,497 INFO L854 garLoopResultBuilder]: At program point L32-4(lines 32 35) the Hoare annotation is: (and (not (<= (div (+ main_~max~0 4294967295) 4294967296) 0)) (<= main_~max~0 5)) [2022-02-15 03:38:48,497 INFO L854 garLoopResultBuilder]: At program point L26-2(lines 26 29) the Hoare annotation is: (let ((.cse23 (+ main_~max~0 4294967295))) (let ((.cse20 (div .cse23 4294967296)) (.cse19 (select |#memory_int| |main_~#str2~0.base|))) (let ((.cse22 (select .cse19 0)) (.cse17 (* .cse20 4294967296)) (.cse6 (select .cse19 2)) (.cse21 (select |#memory_int| |main_~#str1~0.base|)) (.cse13 (select .cse19 1))) (let ((.cse12 (= |main_~#str2~0.offset| 0)) (.cse15 (select .cse19 3)) (.cse2 (= (select .cse21 3) .cse13)) (.cse16 (= .cse6 (select .cse21 2))) (.cse4 (= (+ main_~i~0 main_~j~0 .cse17) (+ main_~max~0 4294967296))) (.cse11 (= .cse22 (select .cse21 (+ |main_~#str1~0.offset| 4)))) (.cse0 (<= 5 main_~max~0)) (.cse1 (<= main_~max~0 5)) (.cse3 (= |main_~#str1~0.offset| 0)) (.cse7 (select .cse21 (+ main_~i~0 |main_~#str1~0.offset|))) (.cse10 (+ main_~i~0 .cse17)) (.cse5 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse8 (+ main_~j~0 |main_~#str2~0.offset|))) (or (let ((.cse9 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 (= .cse6 .cse7) (= .cse8 3) (<= .cse9 .cse10) .cse11 (<= .cse10 .cse9))) (let ((.cse14 (+ main_~max~0 4294967294))) (and .cse12 .cse0 .cse1 .cse3 (= .cse13 .cse7) .cse4 (<= .cse10 .cse14) .cse5 (<= .cse14 .cse10) .cse11)) (and .cse12 (= .cse15 .cse7) .cse2 .cse3 .cse16 .cse4 .cse5 (<= .cse10 (+ 4294967292 main_~max~0)) (<= main_~max~0 (+ main_~i~0 4)) (<= 4294967297 .cse10) (<= .cse10 4294967297) .cse11) (let ((.cse18 (+ 4294967291 main_~max~0))) (and .cse12 (<= .cse17 .cse18) (= (select .cse19 (+ (* .cse20 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|)) .cse7) (<= .cse18 .cse10) (= .cse15 (select .cse21 1)) .cse2 .cse3 .cse16 (<= .cse10 4294967296) (< 0 .cse20) .cse4 .cse5 .cse11)) (and .cse0 (= main_~j~0 1) .cse1 .cse3 (= .cse22 .cse7) (= .cse23 .cse10) .cse5 (= .cse8 1))))))) [2022-02-15 03:38:48,497 INFO L854 garLoopResultBuilder]: At program point L26-3(lines 26 29) the Hoare annotation is: (let ((.cse16 (+ main_~max~0 4294967295))) (let ((.cse13 (div .cse16 4294967296))) (let ((.cse10 (* .cse13 4294967296)) (.cse15 (select |#memory_int| |main_~#str2~0.base|)) (.cse14 (select |#memory_int| |main_~#str1~0.base|))) (let ((.cse9 (+ main_~j~0 |main_~#str2~0.offset|)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse12 (= (select .cse15 3) (select .cse14 1))) (.cse1 (= (select .cse14 3) (select .cse15 1))) (.cse2 (= |main_~#str1~0.offset| 0)) (.cse8 (= (select .cse15 2) (select .cse14 2))) (.cse4 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse3 (+ main_~i~0 .cse10)) (.cse11 (+ 4294967291 main_~max~0)) (.cse5 (let ((.cse18 (<= (+ main_~max~0 2147483648) .cse10))) (or (and (not .cse18) (= (+ main_~i~0 main_~j~0 .cse10 1) main_~max~0)) (and .cse18 (= .cse16 (+ main_~i~0 main_~j~0 .cse10)))))) (.cse7 (= (select .cse15 0) (select .cse14 (+ |main_~#str1~0.offset| 4))))) (or (let ((.cse6 (+ main_~max~0 4294967293))) (and .cse0 .cse1 .cse2 (<= 4294967298 .cse3) .cse4 .cse5 (<= .cse3 4294967298) (<= .cse6 .cse3) .cse7 (<= .cse3 .cse6))) (and .cse1 .cse2 .cse8 .cse4 (<= .cse3 (+ 4294967292 main_~max~0)) (<= main_~max~0 (+ main_~i~0 4)) (<= 4294967297 .cse3) (<= .cse3 4294967297) (= .cse9 3) .cse5 .cse7) (and .cse0 (<= .cse3 4294967295) (<= .cse10 .cse11) .cse12 .cse1 .cse2 .cse8 (< 0 .cse13) .cse4 (= (select .cse14 0) (select .cse15 (+ (* .cse13 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) .cse5 (<= (+ 4294967290 main_~max~0) .cse3) .cse7) (and .cse0 (<= 5 main_~max~0) (<= main_~max~0 5) .cse2 (= main_~j~0 0) (= .cse16 .cse3) .cse4) (let ((.cse17 (+ main_~max~0 4294967294))) (and (<= .cse3 4294967299) .cse2 (<= 4294967299 .cse3) (<= .cse3 .cse17) .cse4 (= .cse9 1) (<= .cse17 .cse3) .cse5 .cse7)) (and .cse0 (<= .cse11 .cse3) .cse12 .cse1 .cse2 .cse8 (<= .cse3 4294967296) (<= 4294967296 .cse3) .cse4 (<= .cse3 .cse11) .cse5 .cse7)))))) [2022-02-15 03:38:48,497 INFO L854 garLoopResultBuilder]: At program point L26-4(lines 26 29) the Hoare annotation is: (let ((.cse3 (+ main_~max~0 4294967295))) (let ((.cse5 (div .cse3 4294967296))) (let ((.cse4 (* .cse5 4294967296))) (let ((.cse0 (+ main_~i~0 .cse4)) (.cse1 (select |#memory_int| |main_~#str2~0.base|)) (.cse2 (select |#memory_int| |main_~#str1~0.base|))) (and (= |main_~#str2~0.offset| 0) (<= .cse0 4294967295) (<= 5 main_~max~0) (= (select .cse1 3) (select .cse2 1)) (= (select .cse2 3) (select .cse1 1)) (= |main_~#str1~0.offset| 0) (= (select .cse1 2) (select .cse2 2)) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (= .cse3 (+ main_~i~0 main_~j~0 .cse4)) (= (select .cse2 0) (select .cse1 (+ (* .cse5 (- 4294967296)) main_~max~0 4294967295 |main_~#str1~0.offset|))) (<= (+ 4294967290 main_~max~0) .cse0) (= (select .cse1 0) (select .cse2 (+ |main_~#str1~0.offset| 4)))))))) [2022-02-15 03:38:48,498 INFO L854 garLoopResultBuilder]: At program point L18-2(lines 18 20) the Hoare annotation is: (let ((.cse6 (div (+ main_~max~0 4294967295) 4294967296))) (let ((.cse1 (<= 5 main_~max~0)) (.cse3 (= |main_~#str1~0.offset| 0)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse5 (not (<= .cse6 0))) (.cse2 (<= main_~max~0 5)) (.cse4 (not (= |main_~#str1~0.base| |main_~#str2~0.base|)))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~i~0 (+ 4294967291 (* (div main_~max~0 4294967296) 4294967296))) (<= main_~max~0 (+ main_~i~0 1))) (and .cse0 .cse5 .cse1 .cse2 .cse3 (= main_~i~0 0) .cse4) (and .cse0 .cse5 .cse2 .cse3 (<= (+ main_~i~0 2) main_~max~0) .cse4 (<= 3 main_~i~0)) (and .cse0 .cse1 .cse3 (<= main_~max~0 (+ main_~i~0 3)) .cse4 (<= (+ main_~i~0 (* .cse6 4294967296)) 4294967298)) (and .cse0 .cse5 .cse2 (<= (+ main_~i~0 4) main_~max~0) (= (+ main_~i~0 |main_~#str1~0.offset|) 1) .cse4 (<= 1 main_~i~0))))) [2022-02-15 03:38:48,498 INFO L854 garLoopResultBuilder]: At program point L18-3(lines 18 20) the Hoare annotation is: (let ((.cse1 (<= 5 main_~max~0)) (.cse2 (<= main_~max~0 5)) (.cse3 (= |main_~#str1~0.offset| 0)) (.cse0 (= |main_~#str2~0.offset| 0)) (.cse4 (not (= |main_~#str1~0.base| |main_~#str2~0.base|))) (.cse5 (+ main_~i~0 (* (div (+ main_~max~0 4294967295) 4294967296) 4294967296)))) (or (and .cse0 .cse1 .cse2 .cse3 (= main_~i~0 0) .cse4) (and .cse0 .cse1 .cse3 (<= main_~max~0 (+ main_~i~0 3)) .cse4 (<= .cse5 4294967298)) (and .cse0 .cse1 .cse2 .cse3 (<= main_~i~0 (+ 4294967292 (* (div main_~max~0 4294967296) 4294967296))) (<= 4294967299 .cse5) .cse4) (let ((.cse6 (+ main_~i~0 4))) (and .cse0 (<= .cse6 main_~max~0) (= (+ main_~i~0 |main_~#str1~0.offset|) 1) .cse4 (<= main_~max~0 .cse6) (<= .cse5 4294967297) (<= 1 main_~i~0))))) [2022-02-15 03:38:48,498 INFO L854 garLoopResultBuilder]: At program point L18-4(lines 18 20) the Hoare annotation is: (and (= |main_~#str2~0.offset| 0) (<= 5 main_~max~0) (<= main_~max~0 5) (= |main_~#str1~0.offset| 0) (<= main_~i~0 (+ 4294967292 (* (div main_~max~0 4294967296) 4294967296))) (not (= |main_~#str1~0.base| |main_~#str2~0.base|)) (<= main_~max~0 main_~i~0)) [2022-02-15 03:38:48,498 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-02-15 03:38:48,498 INFO L854 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-02-15 03:38:48,498 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-02-15 03:38:48,498 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-02-15 03:38:48,498 INFO L861 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-02-15 03:38:48,498 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-02-15 03:38:48,498 INFO L861 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-02-15 03:38:48,498 INFO L861 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 5 10) the Hoare annotation is: true [2022-02-15 03:38:48,498 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-15 03:38:48,498 INFO L854 garLoopResultBuilder]: At program point L7(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-15 03:38:48,499 INFO L854 garLoopResultBuilder]: At program point L6(lines 6 8) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-15 03:38:48,499 INFO L854 garLoopResultBuilder]: At program point L6-2(lines 5 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2022-02-15 03:38:48,499 INFO L854 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 7) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2022-02-15 03:38:48,504 INFO L732 BasicCegarLoop]: Path program histogram: [9, 6, 1, 1] [2022-02-15 03:38:48,506 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-15 03:38:48,551 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.02 03:38:48 BoogieIcfgContainer [2022-02-15 03:38:48,551 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-15 03:38:48,551 INFO L158 Benchmark]: Toolchain (without parser) took 32684.58ms. Allocated memory was 215.0MB in the beginning and 373.3MB in the end (delta: 158.3MB). Free memory was 166.3MB in the beginning and 142.3MB in the end (delta: 24.0MB). Peak memory consumption was 204.5MB. Max. memory is 8.0GB. [2022-02-15 03:38:48,552 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory is still 183.2MB. There was no memory consumed. Max. memory is 8.0GB. [2022-02-15 03:38:48,552 INFO L158 Benchmark]: CACSL2BoogieTranslator took 202.74ms. Allocated memory is still 215.0MB. Free memory was 166.1MB in the beginning and 192.7MB in the end (delta: -26.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. [2022-02-15 03:38:48,552 INFO L158 Benchmark]: Boogie Preprocessor took 20.70ms. Allocated memory is still 215.0MB. Free memory was 192.7MB in the beginning and 191.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-02-15 03:38:48,552 INFO L158 Benchmark]: RCFGBuilder took 234.79ms. Allocated memory is still 215.0MB. Free memory was 191.1MB in the beginning and 179.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-02-15 03:38:48,552 INFO L158 Benchmark]: TraceAbstraction took 32222.04ms. Allocated memory was 215.0MB in the beginning and 373.3MB in the end (delta: 158.3MB). Free memory was 179.1MB in the beginning and 142.3MB in the end (delta: 36.8MB). Peak memory consumption was 217.6MB. Max. memory is 8.0GB. [2022-02-15 03:38:48,553 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.09ms. Allocated memory is still 215.0MB. Free memory is still 183.2MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 202.74ms. Allocated memory is still 215.0MB. Free memory was 166.1MB in the beginning and 192.7MB in the end (delta: -26.5MB). Peak memory consumption was 9.9MB. Max. memory is 8.0GB. * Boogie Preprocessor took 20.70ms. Allocated memory is still 215.0MB. Free memory was 192.7MB in the beginning and 191.1MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 234.79ms. Allocated memory is still 215.0MB. Free memory was 191.1MB in the beginning and 179.6MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 32222.04ms. Allocated memory was 215.0MB in the beginning and 373.3MB in the end (delta: 158.3MB). Free memory was 179.1MB in the beginning and 142.3MB in the end (delta: 36.8MB). Peak memory consumption was 217.6MB. Max. memory is 8.0GB. * 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 - PositiveResult [Line: 7]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 32.1s, OverallIterations: 17, TraceHistogramMax: 6, PathProgramHistogramMax: 9, EmptinessCheckTime: 0.0s, AutomataDifference: 12.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 12.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 836 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 831 mSDsluCounter, 849 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 543 mSDsCounter, 1213 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4693 IncrementalHoareTripleChecker+Invalid, 5906 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 1213 mSolverCounterUnsat, 306 mSDtfsCounter, 4693 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 502 GetRequests, 96 SyntacticMatches, 4 SemanticMatches, 402 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4479 ImplicationChecksByTransitivity, 11.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=78occurred in iteration=16, InterpolantAutomatonStates: 268, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 98 StatesRemovedByMinimization, 16 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 27 LocationsWithAnnotation, 159 PreInvPairs, 219 NumberOfFragments, 4923 HoareAnnotationTreeSize, 159 FomulaSimplifications, 820 FormulaSimplificationTreeSizeReduction, 7.8s HoareSimplificationTime, 27 FomulaSimplificationsInter, 2175697 FormulaSimplificationTreeSizeReductionInter, 4.2s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 32]: Loop Invariant Derived loop invariant: ((((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && j == 0) && max + 4294967295 == i + (max + 4294967295) / 4294967296 * 4294967296) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) || ((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && i <= 4294967292 + max / 4294967296 * 4294967296) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && max <= i) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 1 <= j + str2) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && j <= 1) && 3 <= i) && i <= 3) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && j <= 2) && 2 <= j + str2) && ((((((((str2 == 0 && 1 <= i + str1) && 5 <= max) && max <= 5) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) || (((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && str1 == 0) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]))) && !(str1 == str2)) && max + 4294967293 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967293)) || ((((((((((((str2 == 0 && unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1] == unknown-#memory_int-unknown[str1][i + str1]) && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i == 0) && !(str1 == str2)) && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || (((((((((((((((str2 == 0 && 5 <= max) && max <= 5) && unknown-#memory_int-unknown[str2][j + str2] == unknown-#memory_int-unknown[str1][i + str1]) && (!(i + str1 == 0) || max + 4294967295 + str1 == i + j + str2 + (max + 4294967295) / 4294967296 * 4294967296)) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + str1 == 1) && 3 <= j) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && 1 <= i) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && j <= 3) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: (((((((((((((str2 == 0 && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && 4294967298 <= i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2)) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967298) && max + 4294967293 <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967293) || ((((((((((unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1] && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967292 + max) && max <= i + 4) && 4294967297 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && j + str2 == 3) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((((((((str2 == 0 && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967295) && (max + 4294967295) / 4294967296 * 4294967296 <= 4294967291 + max) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && 0 < (max + 4294967295) / 4294967296) && !(str1 == str2)) && unknown-#memory_int-unknown[str1][0] == unknown-#memory_int-unknown[str2][(max + 4294967295) / 4294967296 * -4294967296 + max + 4294967295 + str1]) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && 4294967290 + max <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || ((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && j == 0) && max + 4294967295 == i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2))) || ((((((((i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967299 && str1 == 0) && 4294967299 <= i + (max + 4294967295) / 4294967296 * 4294967296) && i + (max + 4294967295) / 4294967296 * 4294967296 <= max + 4294967294) && !(str1 == str2)) && j + str2 == 1) && max + 4294967294 <= i + (max + 4294967295) / 4294967296 * 4294967296) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4])) || (((((((((((str2 == 0 && 4294967291 + max <= i + (max + 4294967295) / 4294967296 * 4294967296) && unknown-#memory_int-unknown[str2][3] == unknown-#memory_int-unknown[str1][1]) && unknown-#memory_int-unknown[str1][3] == unknown-#memory_int-unknown[str2][1]) && str1 == 0) && unknown-#memory_int-unknown[str2][2] == unknown-#memory_int-unknown[str1][2]) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967296) && 4294967296 <= i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967291 + max) && ((!(max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296) && i + j + (max + 4294967295) / 4294967296 * 4294967296 + 1 == max) || (max + 2147483648 <= (max + 4294967295) / 4294967296 * 4294967296 && max + 4294967295 == i + j + (max + 4294967295) / 4294967296 * 4294967296))) && unknown-#memory_int-unknown[str2][0] == unknown-#memory_int-unknown[str1][str1 + 4]) - InvariantResult [Line: 18]: Loop Invariant Derived loop invariant: (((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && i == 0) && !(str1 == str2)) || (((((str2 == 0 && 5 <= max) && str1 == 0) && max <= i + 3) && !(str1 == str2)) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967298)) || ((((((str2 == 0 && 5 <= max) && max <= 5) && str1 == 0) && i <= 4294967292 + max / 4294967296 * 4294967296) && 4294967299 <= i + (max + 4294967295) / 4294967296 * 4294967296) && !(str1 == str2))) || ((((((str2 == 0 && i + 4 <= max) && i + str1 == 1) && !(str1 == str2)) && max <= i + 4) && i + (max + 4294967295) / 4294967296 * 4294967296 <= 4294967297) && 1 <= i) - ProcedureContractResult [Line: 13]: Procedure Contract for main Derived contract for procedure main: !((max + 4294967295) / 4294967296 <= 0) && max <= 5 - ProcedureContractResult [Line: 5]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) RESULT: Ultimate proved your program to be correct! [2022-02-15 03:38:48,573 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...