/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml --traceabstraction.compute.interpolants.along.a.counterexample Craig_NestedInterpolation --traceabstraction.use.separate.solver.for.trace.checks true -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf -i ../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-3af5e1f [2020-09-04 21:57:55,287 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-09-04 21:57:55,291 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-09-04 21:57:55,338 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-09-04 21:57:55,338 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-09-04 21:57:55,339 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-09-04 21:57:55,341 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-09-04 21:57:55,343 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-09-04 21:57:55,345 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-09-04 21:57:55,346 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-09-04 21:57:55,347 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-09-04 21:57:55,348 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-09-04 21:57:55,349 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-09-04 21:57:55,350 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-09-04 21:57:55,351 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-09-04 21:57:55,353 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-09-04 21:57:55,354 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-09-04 21:57:55,355 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-09-04 21:57:55,357 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-09-04 21:57:55,359 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-09-04 21:57:55,361 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-09-04 21:57:55,363 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-09-04 21:57:55,364 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-09-04 21:57:55,365 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-09-04 21:57:55,368 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-09-04 21:57:55,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-09-04 21:57:55,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-09-04 21:57:55,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-09-04 21:57:55,370 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-09-04 21:57:55,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-09-04 21:57:55,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-09-04 21:57:55,373 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-09-04 21:57:55,374 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-09-04 21:57:55,375 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-09-04 21:57:55,376 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-09-04 21:57:55,376 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-09-04 21:57:55,377 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-09-04 21:57:55,377 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-09-04 21:57:55,378 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-09-04 21:57:55,379 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-09-04 21:57:55,380 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-09-04 21:57:55,381 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationFastUPR_32.epf [2020-09-04 21:57:55,393 INFO L113 SettingsManager]: Loading preferences was successful [2020-09-04 21:57:55,394 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-09-04 21:57:55,395 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-09-04 21:57:55,396 INFO L138 SettingsManager]: * sizeof long=4 [2020-09-04 21:57:55,396 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-09-04 21:57:55,396 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-09-04 21:57:55,399 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-09-04 21:57:55,399 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-09-04 21:57:55,399 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-09-04 21:57:55,399 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-09-04 21:57:55,400 INFO L138 SettingsManager]: * sizeof long double=12 [2020-09-04 21:57:55,400 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-09-04 21:57:55,400 INFO L138 SettingsManager]: * Use constant arrays=true [2020-09-04 21:57:55,400 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-09-04 21:57:55,401 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-09-04 21:57:55,401 INFO L138 SettingsManager]: * Size of a code block=SingleStatement [2020-09-04 21:57:55,401 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-09-04 21:57:55,401 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-09-04 21:57:55,401 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:57:55,402 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-09-04 21:57:55,402 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=AcceleratedInterpolation [2020-09-04 21:57:55,402 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-09-04 21:57:55,402 INFO L138 SettingsManager]: * Use separate solver for trace checks=false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Compute Interpolants along a Counterexample -> Craig_NestedInterpolation Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use separate solver for trace checks -> true [2020-09-04 21:57:55,845 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-09-04 21:57:55,862 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-09-04 21:57:55,867 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-09-04 21:57:55,869 INFO L271 PluginConnector]: Initializing CDTParser... [2020-09-04 21:57:55,869 INFO L275 PluginConnector]: CDTParser initialized [2020-09-04 21:57:55,870 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-09-04 21:57:55,958 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e2daac681/bc49128fa9c544b3805fd321bc58178a/FLAGc106b08d0 [2020-09-04 21:57:56,503 INFO L306 CDTParser]: Found 1 translation units. [2020-09-04 21:57:56,504 INFO L160 CDTParser]: Scanning /storage/repos/ultimate-2/trunk/examples/svcomp/verifythis/elimination_max_rec_onepoint.c [2020-09-04 21:57:56,513 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e2daac681/bc49128fa9c544b3805fd321bc58178a/FLAGc106b08d0 [2020-09-04 21:57:56,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/data/e2daac681/bc49128fa9c544b3805fd321bc58178a [2020-09-04 21:57:56,831 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-09-04 21:57:56,833 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-09-04 21:57:56,834 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:56,834 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-09-04 21:57:56,839 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-09-04 21:57:56,840 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,844 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bb34a3d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:56, skipping insertion in model container [2020-09-04 21:57:56,844 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.09 09:57:56" (1/1) ... [2020-09-04 21:57:56,854 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-09-04 21:57:56,882 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-09-04 21:57:57,099 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:57,125 INFO L203 MainTranslator]: Completed pre-run [2020-09-04 21:57:57,174 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-09-04 21:57:57,198 INFO L208 MainTranslator]: Completed translation [2020-09-04 21:57:57,199 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57 WrapperNode [2020-09-04 21:57:57,199 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-09-04 21:57:57,200 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-09-04 21:57:57,200 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-09-04 21:57:57,200 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-09-04 21:57:57,295 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... [2020-09-04 21:57:57,295 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... [2020-09-04 21:57:57,305 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... [2020-09-04 21:57:57,306 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... [2020-09-04 21:57:57,316 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... [2020-09-04 21:57:57,318 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... [2020-09-04 21:57:57,320 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... [2020-09-04 21:57:57,323 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-09-04 21:57:57,324 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-09-04 21:57:57,324 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-09-04 21:57:57,324 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-09-04 21:57:57,325 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (1/1) ... No working directory specified, using /storage/repos/ultimate-2/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-09-04 21:57:57,395 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-09-04 21:57:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-09-04 21:57:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-09-04 21:57:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-09-04 21:57:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure check [2020-09-04 21:57:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-09-04 21:57:57,396 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2020-09-04 21:57:57,397 INFO L130 BoogieDeclarations]: Found specification of procedure calloc [2020-09-04 21:57:57,397 INFO L130 BoogieDeclarations]: Found specification of procedure free [2020-09-04 21:57:57,397 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-09-04 21:57:57,397 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-09-04 21:57:57,397 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-09-04 21:57:57,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-09-04 21:57:57,398 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-09-04 21:57:57,398 INFO L130 BoogieDeclarations]: Found specification of procedure check [2020-09-04 21:57:57,398 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-09-04 21:57:57,399 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-09-04 21:57:57,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-09-04 21:57:57,399 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2020-09-04 21:57:57,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-09-04 21:57:57,399 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-09-04 21:57:57,400 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-09-04 21:57:57,400 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-09-04 21:57:57,808 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-09-04 21:57:57,808 INFO L295 CfgBuilder]: Removed 0 assume(true) statements. [2020-09-04 21:57:57,815 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:57 BoogieIcfgContainer [2020-09-04 21:57:57,815 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-09-04 21:57:57,817 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-09-04 21:57:57,817 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-09-04 21:57:57,821 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-09-04 21:57:57,821 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.09 09:57:56" (1/3) ... [2020-09-04 21:57:57,822 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3738ebdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:57, skipping insertion in model container [2020-09-04 21:57:57,822 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.09 09:57:57" (2/3) ... [2020-09-04 21:57:57,823 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3738ebdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.09 09:57:57, skipping insertion in model container [2020-09-04 21:57:57,823 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 04.09 09:57:57" (3/3) ... [2020-09-04 21:57:57,825 INFO L109 eAbstractionObserver]: Analyzing ICFG elimination_max_rec_onepoint.c [2020-09-04 21:57:57,837 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2020-09-04 21:57:57,847 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-09-04 21:57:57,868 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-09-04 21:57:57,893 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-09-04 21:57:57,893 INFO L376 AbstractCegarLoop]: Hoare is true [2020-09-04 21:57:57,893 INFO L377 AbstractCegarLoop]: Compute interpolants for Craig_NestedInterpolation [2020-09-04 21:57:57,893 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-09-04 21:57:57,893 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-09-04 21:57:57,894 INFO L380 AbstractCegarLoop]: Difference is false [2020-09-04 21:57:57,894 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-09-04 21:57:57,894 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-09-04 21:57:57,911 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states. [2020-09-04 21:57:57,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2020-09-04 21:57:57,924 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:57,925 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:57,926 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:57,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:57,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1228919024, now seen corresponding path program 1 times [2020-09-04 21:57:57,942 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:57,943 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1518460525] [2020-09-04 21:57:57,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:58,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:58,336 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:58,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:58,348 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:57:58,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:58,355 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:57:58,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:58,380 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:57:58,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:58,412 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:57:58,416 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1518460525] [2020-09-04 21:57:58,419 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:57:58,419 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2020-09-04 21:57:58,420 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001139786] [2020-09-04 21:57:58,427 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-09-04 21:57:58,427 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:58,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-09-04 21:57:58,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2020-09-04 21:57:58,449 INFO L87 Difference]: Start difference. First operand 87 states. Second operand 10 states. [2020-09-04 21:57:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:57:59,469 INFO L93 Difference]: Finished difference Result 221 states and 257 transitions. [2020-09-04 21:57:59,470 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2020-09-04 21:57:59,471 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 40 [2020-09-04 21:57:59,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:57:59,491 INFO L225 Difference]: With dead ends: 221 [2020-09-04 21:57:59,491 INFO L226 Difference]: Without dead ends: 138 [2020-09-04 21:57:59,499 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:57:59,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2020-09-04 21:57:59,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 122. [2020-09-04 21:57:59,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 122 states. [2020-09-04 21:57:59,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 132 transitions. [2020-09-04 21:57:59,589 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 132 transitions. Word has length 40 [2020-09-04 21:57:59,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:57:59,590 INFO L479 AbstractCegarLoop]: Abstraction has 122 states and 132 transitions. [2020-09-04 21:57:59,590 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-09-04 21:57:59,590 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 132 transitions. [2020-09-04 21:57:59,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2020-09-04 21:57:59,597 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:57:59,597 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:57:59,598 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-09-04 21:57:59,598 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:57:59,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:57:59,598 INFO L82 PathProgramCache]: Analyzing trace with hash -2013393660, now seen corresponding path program 1 times [2020-09-04 21:57:59,599 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:57:59,599 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1127433223] [2020-09-04 21:57:59,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:57:59,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,847 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:57:59,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,853 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:57:59,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,857 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:57:59,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,877 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:57:59,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,905 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2020-09-04 21:57:59,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:57:59,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2020-09-04 21:57:59,922 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1127433223] [2020-09-04 21:57:59,922 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:57:59,922 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2020-09-04 21:57:59,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402680344] [2020-09-04 21:57:59,925 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2020-09-04 21:57:59,925 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:57:59,925 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2020-09-04 21:57:59,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=131, Unknown=0, NotChecked=0, Total=156 [2020-09-04 21:57:59,926 INFO L87 Difference]: Start difference. First operand 122 states and 132 transitions. Second operand 13 states. [2020-09-04 21:58:00,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:00,799 INFO L93 Difference]: Finished difference Result 128 states and 137 transitions. [2020-09-04 21:58:00,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2020-09-04 21:58:00,801 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 52 [2020-09-04 21:58:00,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:00,806 INFO L225 Difference]: With dead ends: 128 [2020-09-04 21:58:00,806 INFO L226 Difference]: Without dead ends: 108 [2020-09-04 21:58:00,809 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=106, Invalid=494, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:58:00,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2020-09-04 21:58:00,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2020-09-04 21:58:00,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2020-09-04 21:58:00,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 116 transitions. [2020-09-04 21:58:00,849 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 116 transitions. Word has length 52 [2020-09-04 21:58:00,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:00,850 INFO L479 AbstractCegarLoop]: Abstraction has 108 states and 116 transitions. [2020-09-04 21:58:00,850 INFO L480 AbstractCegarLoop]: Interpolant automaton has 13 states. [2020-09-04 21:58:00,850 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 116 transitions. [2020-09-04 21:58:00,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 21:58:00,855 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:00,856 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:00,856 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-09-04 21:58:00,856 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:00,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:00,857 INFO L82 PathProgramCache]: Analyzing trace with hash 1709597342, now seen corresponding path program 1 times [2020-09-04 21:58:00,857 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:00,857 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [2049386010] [2020-09-04 21:58:00,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:00,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,158 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:01,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,164 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:01,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,176 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:01,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,203 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:01,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,208 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:01,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,214 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:01,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:01,230 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 21:58:01,230 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [2049386010] [2020-09-04 21:58:01,231 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:01,231 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:58:01,231 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901390050] [2020-09-04 21:58:01,232 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:58:01,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:01,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:58:01,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=183, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:58:01,233 INFO L87 Difference]: Start difference. First operand 108 states and 116 transitions. Second operand 15 states. [2020-09-04 21:58:02,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:02,762 INFO L93 Difference]: Finished difference Result 179 states and 194 transitions. [2020-09-04 21:58:02,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2020-09-04 21:58:02,763 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-09-04 21:58:02,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:02,766 INFO L225 Difference]: With dead ends: 179 [2020-09-04 21:58:02,767 INFO L226 Difference]: Without dead ends: 177 [2020-09-04 21:58:02,768 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=160, Invalid=710, Unknown=0, NotChecked=0, Total=870 [2020-09-04 21:58:02,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2020-09-04 21:58:02,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 151. [2020-09-04 21:58:02,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 151 states. [2020-09-04 21:58:02,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 164 transitions. [2020-09-04 21:58:02,805 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 164 transitions. Word has length 67 [2020-09-04 21:58:02,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:02,806 INFO L479 AbstractCegarLoop]: Abstraction has 151 states and 164 transitions. [2020-09-04 21:58:02,806 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:58:02,806 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 164 transitions. [2020-09-04 21:58:02,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2020-09-04 21:58:02,808 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:02,808 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:02,808 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-09-04 21:58:02,809 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:02,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:02,809 INFO L82 PathProgramCache]: Analyzing trace with hash 587834366, now seen corresponding path program 1 times [2020-09-04 21:58:02,809 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:02,810 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1123080753] [2020-09-04 21:58:02,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:02,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,083 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:03,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,087 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:03,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,094 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:03,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,116 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:03,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,121 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:03,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,132 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:03,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:03,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 21:58:03,152 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1123080753] [2020-09-04 21:58:03,153 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-09-04 21:58:03,153 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2020-09-04 21:58:03,153 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729642156] [2020-09-04 21:58:03,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:58:03,155 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:03,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:58:03,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=179, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:58:03,156 INFO L87 Difference]: Start difference. First operand 151 states and 164 transitions. Second operand 15 states. [2020-09-04 21:58:04,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:04,738 INFO L93 Difference]: Finished difference Result 221 states and 242 transitions. [2020-09-04 21:58:04,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2020-09-04 21:58:04,739 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2020-09-04 21:58:04,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:04,742 INFO L225 Difference]: With dead ends: 221 [2020-09-04 21:58:04,742 INFO L226 Difference]: Without dead ends: 219 [2020-09-04 21:58:04,743 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 139 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=250, Invalid=806, Unknown=0, NotChecked=0, Total=1056 [2020-09-04 21:58:04,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2020-09-04 21:58:04,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 194. [2020-09-04 21:58:04,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 194 states. [2020-09-04 21:58:04,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 212 transitions. [2020-09-04 21:58:04,774 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 212 transitions. Word has length 67 [2020-09-04 21:58:04,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:04,775 INFO L479 AbstractCegarLoop]: Abstraction has 194 states and 212 transitions. [2020-09-04 21:58:04,775 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:58:04,775 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 212 transitions. [2020-09-04 21:58:04,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2020-09-04 21:58:04,777 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:04,777 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:04,777 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-09-04 21:58:04,778 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:04,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:04,778 INFO L82 PathProgramCache]: Analyzing trace with hash 687369648, now seen corresponding path program 1 times [2020-09-04 21:58:04,778 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:04,779 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [830034838] [2020-09-04 21:58:04,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:04,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:04,970 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:04,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:04,975 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:04,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:04,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:04,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:05,000 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:05,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:05,030 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:05,036 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:05,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:05,040 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2020-09-04 21:58:05,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:05,059 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2020-09-04 21:58:05,059 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [830034838] [2020-09-04 21:58:05,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:05,060 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15] total 15 [2020-09-04 21:58:05,060 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12606016] [2020-09-04 21:58:05,062 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2020-09-04 21:58:05,065 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:05,066 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2020-09-04 21:58:05,066 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=181, Unknown=0, NotChecked=0, Total=210 [2020-09-04 21:58:05,069 INFO L87 Difference]: Start difference. First operand 194 states and 212 transitions. Second operand 15 states. [2020-09-04 21:58:05,959 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:05,960 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-09-04 21:58:05,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2020-09-04 21:58:05,960 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 79 [2020-09-04 21:58:05,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:05,962 INFO L225 Difference]: With dead ends: 206 [2020-09-04 21:58:05,963 INFO L226 Difference]: Without dead ends: 142 [2020-09-04 21:58:05,964 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=148, Invalid=664, Unknown=0, NotChecked=0, Total=812 [2020-09-04 21:58:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2020-09-04 21:58:05,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 113. [2020-09-04 21:58:05,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 113 states. [2020-09-04 21:58:05,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 120 transitions. [2020-09-04 21:58:05,982 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 120 transitions. Word has length 79 [2020-09-04 21:58:05,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:05,983 INFO L479 AbstractCegarLoop]: Abstraction has 113 states and 120 transitions. [2020-09-04 21:58:05,983 INFO L480 AbstractCegarLoop]: Interpolant automaton has 15 states. [2020-09-04 21:58:05,983 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2020-09-04 21:58:05,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-04 21:58:05,985 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:05,985 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:05,985 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-09-04 21:58:05,985 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:05,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:05,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1486199216, now seen corresponding path program 2 times [2020-09-04 21:58:05,986 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:05,986 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [100921744] [2020-09-04 21:58:05,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:06,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,424 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,429 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:06,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,433 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:06,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,456 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:06,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,459 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:06,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,467 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 21:58:06,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,482 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:58:06,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 13 proven. 24 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-09-04 21:58:06,504 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [100921744] [2020-09-04 21:58:06,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:06,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:58:06,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581942087] [2020-09-04 21:58:06,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:58:06,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:06,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:58:06,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:58:06,506 INFO L87 Difference]: Start difference. First operand 113 states and 120 transitions. Second operand 20 states. [2020-09-04 21:58:08,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:08,304 INFO L93 Difference]: Finished difference Result 168 states and 179 transitions. [2020-09-04 21:58:08,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2020-09-04 21:58:08,305 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-09-04 21:58:08,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:08,308 INFO L225 Difference]: With dead ends: 168 [2020-09-04 21:58:08,308 INFO L226 Difference]: Without dead ends: 166 [2020-09-04 21:58:08,309 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 244 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=305, Invalid=1501, Unknown=0, NotChecked=0, Total=1806 [2020-09-04 21:58:08,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2020-09-04 21:58:08,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2020-09-04 21:58:08,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2020-09-04 21:58:08,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 128 transitions. [2020-09-04 21:58:08,327 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 128 transitions. Word has length 94 [2020-09-04 21:58:08,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:08,328 INFO L479 AbstractCegarLoop]: Abstraction has 119 states and 128 transitions. [2020-09-04 21:58:08,328 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:58:08,328 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 128 transitions. [2020-09-04 21:58:08,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-04 21:58:08,329 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:08,330 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:08,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-09-04 21:58:08,330 INFO L427 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:08,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:08,331 INFO L82 PathProgramCache]: Analyzing trace with hash 1687005104, now seen corresponding path program 1 times [2020-09-04 21:58:08,331 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:08,331 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1384676390] [2020-09-04 21:58:08,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,742 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:08,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,746 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:08,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,749 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:08,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,786 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:08,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,789 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:08,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,795 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:08,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,801 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 21:58:08,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,806 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:58:08,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:08,823 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 12 proven. 20 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-09-04 21:58:08,824 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1384676390] [2020-09-04 21:58:08,824 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:08,824 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:58:08,825 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082566609] [2020-09-04 21:58:08,826 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:58:08,826 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:08,826 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:58:08,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:58:08,827 INFO L87 Difference]: Start difference. First operand 119 states and 128 transitions. Second operand 20 states. [2020-09-04 21:58:10,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:10,851 INFO L93 Difference]: Finished difference Result 191 states and 204 transitions. [2020-09-04 21:58:10,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 21:58:10,852 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-09-04 21:58:10,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:10,854 INFO L225 Difference]: With dead ends: 191 [2020-09-04 21:58:10,854 INFO L226 Difference]: Without dead ends: 189 [2020-09-04 21:58:10,855 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 289 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=332, Invalid=1648, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 21:58:10,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2020-09-04 21:58:10,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 142. [2020-09-04 21:58:10,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 142 states. [2020-09-04 21:58:10,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 153 transitions. [2020-09-04 21:58:10,876 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 153 transitions. Word has length 94 [2020-09-04 21:58:10,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:10,877 INFO L479 AbstractCegarLoop]: Abstraction has 142 states and 153 transitions. [2020-09-04 21:58:10,877 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:58:10,877 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 153 transitions. [2020-09-04 21:58:10,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2020-09-04 21:58:10,879 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:10,879 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:10,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-09-04 21:58:10,879 INFO L427 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:10,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:10,880 INFO L82 PathProgramCache]: Analyzing trace with hash 766068976, now seen corresponding path program 2 times [2020-09-04 21:58:10,880 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:10,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1496427679] [2020-09-04 21:58:10,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:10,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,218 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:11,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,222 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:11,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,224 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:11,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,256 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:11,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,259 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:11,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,264 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:11,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,268 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 21:58:11,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:58:11,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:11,288 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 17 proven. 15 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2020-09-04 21:58:11,289 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1496427679] [2020-09-04 21:58:11,289 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:11,289 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20] total 20 [2020-09-04 21:58:11,290 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2010106874] [2020-09-04 21:58:11,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2020-09-04 21:58:11,290 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:11,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2020-09-04 21:58:11,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=339, Unknown=0, NotChecked=0, Total=380 [2020-09-04 21:58:11,291 INFO L87 Difference]: Start difference. First operand 142 states and 153 transitions. Second operand 20 states. [2020-09-04 21:58:13,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:13,436 INFO L93 Difference]: Finished difference Result 208 states and 223 transitions. [2020-09-04 21:58:13,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2020-09-04 21:58:13,437 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2020-09-04 21:58:13,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:13,444 INFO L225 Difference]: With dead ends: 208 [2020-09-04 21:58:13,445 INFO L226 Difference]: Without dead ends: 206 [2020-09-04 21:58:13,446 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 303 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=346, Invalid=1634, Unknown=0, NotChecked=0, Total=1980 [2020-09-04 21:58:13,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-09-04 21:58:13,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 182. [2020-09-04 21:58:13,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 182 states. [2020-09-04 21:58:13,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 195 transitions. [2020-09-04 21:58:13,494 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 195 transitions. Word has length 94 [2020-09-04 21:58:13,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:13,496 INFO L479 AbstractCegarLoop]: Abstraction has 182 states and 195 transitions. [2020-09-04 21:58:13,496 INFO L480 AbstractCegarLoop]: Interpolant automaton has 20 states. [2020-09-04 21:58:13,496 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 195 transitions. [2020-09-04 21:58:13,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 21:58:13,499 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:13,499 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:13,500 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-09-04 21:58:13,500 INFO L427 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:13,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:13,500 INFO L82 PathProgramCache]: Analyzing trace with hash 888595646, now seen corresponding path program 3 times [2020-09-04 21:58:13,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:13,510 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [657226703] [2020-09-04 21:58:13,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,089 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:14,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,093 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:14,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,098 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:14,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,127 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:14,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,130 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:14,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,134 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:14,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,139 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 21:58:14,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,144 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:58:14,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,148 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 21:58:14,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,152 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 21:58:14,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:14,189 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 37 proven. 37 refuted. 0 times theorem prover too weak. 52 trivial. 0 not checked. [2020-09-04 21:58:14,190 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [657226703] [2020-09-04 21:58:14,190 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:14,190 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25] total 25 [2020-09-04 21:58:14,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453601424] [2020-09-04 21:58:14,193 INFO L459 AbstractCegarLoop]: Interpolant automaton has 25 states [2020-09-04 21:58:14,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:14,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2020-09-04 21:58:14,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=541, Unknown=0, NotChecked=0, Total=600 [2020-09-04 21:58:14,195 INFO L87 Difference]: Start difference. First operand 182 states and 195 transitions. Second operand 25 states. [2020-09-04 21:58:17,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:17,100 INFO L93 Difference]: Finished difference Result 237 states and 252 transitions. [2020-09-04 21:58:17,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2020-09-04 21:58:17,101 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 121 [2020-09-04 21:58:17,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:17,103 INFO L225 Difference]: With dead ends: 237 [2020-09-04 21:58:17,104 INFO L226 Difference]: Without dead ends: 171 [2020-09-04 21:58:17,106 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 583 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=576, Invalid=2846, Unknown=0, NotChecked=0, Total=3422 [2020-09-04 21:58:17,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2020-09-04 21:58:17,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 159. [2020-09-04 21:58:17,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2020-09-04 21:58:17,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 169 transitions. [2020-09-04 21:58:17,131 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 169 transitions. Word has length 121 [2020-09-04 21:58:17,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:17,132 INFO L479 AbstractCegarLoop]: Abstraction has 159 states and 169 transitions. [2020-09-04 21:58:17,132 INFO L480 AbstractCegarLoop]: Interpolant automaton has 25 states. [2020-09-04 21:58:17,132 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 169 transitions. [2020-09-04 21:58:17,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2020-09-04 21:58:17,134 INFO L414 BasicCegarLoop]: Found error trace [2020-09-04 21:58:17,134 INFO L422 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-09-04 21:58:17,134 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-09-04 21:58:17,135 INFO L427 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-09-04 21:58:17,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-09-04 21:58:17,135 INFO L82 PathProgramCache]: Analyzing trace with hash -32340482, now seen corresponding path program 4 times [2020-09-04 21:58:17,135 INFO L163 FreeRefinementEngine]: Executing refinement strategy FIXED_PREFERENCES [2020-09-04 21:58:17,136 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModulePreferences [1643742800] [2020-09-04 21:58:17,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-09-04 21:58:17,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,269 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2020-09-04 21:58:17,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,272 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2020-09-04 21:58:17,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,275 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 18 [2020-09-04 21:58:17,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,289 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2020-09-04 21:58:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,306 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2020-09-04 21:58:17,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,310 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2020-09-04 21:58:17,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,318 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2020-09-04 21:58:17,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,322 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 68 [2020-09-04 21:58:17,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,328 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 90 [2020-09-04 21:58:17,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,331 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 95 [2020-09-04 21:58:17,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-09-04 21:58:17,363 INFO L134 CoverageAnalysis]: Checked inductivity of 126 backedges. 54 proven. 1 refuted. 0 times theorem prover too weak. 71 trivial. 0 not checked. [2020-09-04 21:58:17,364 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModulePreferences [1643742800] [2020-09-04 21:58:17,364 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-09-04 21:58:17,365 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2020-09-04 21:58:17,365 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [264694130] [2020-09-04 21:58:17,366 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2020-09-04 21:58:17,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy FIXED_PREFERENCES [2020-09-04 21:58:17,367 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2020-09-04 21:58:17,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2020-09-04 21:58:17,368 INFO L87 Difference]: Start difference. First operand 159 states and 169 transitions. Second operand 11 states. [2020-09-04 21:58:17,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-09-04 21:58:17,888 INFO L93 Difference]: Finished difference Result 163 states and 172 transitions. [2020-09-04 21:58:17,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2020-09-04 21:58:17,889 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 121 [2020-09-04 21:58:17,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-09-04 21:58:17,890 INFO L225 Difference]: With dead ends: 163 [2020-09-04 21:58:17,891 INFO L226 Difference]: Without dead ends: 0 [2020-09-04 21:58:17,892 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2020-09-04 21:58:17,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-09-04 21:58:17,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-09-04 21:58:17,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-09-04 21:58:17,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-09-04 21:58:17,893 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 121 [2020-09-04 21:58:17,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-09-04 21:58:17,894 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-09-04 21:58:17,894 INFO L480 AbstractCegarLoop]: Interpolant automaton has 11 states. [2020-09-04 21:58:17,894 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-09-04 21:58:17,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-09-04 21:58:17,895 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-09-04 21:58:17,899 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-09-04 21:58:23,777 WARN L193 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 67 DAG size of output: 48 [2020-09-04 21:58:23,979 WARN L193 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-09-04 21:58:24,349 WARN L193 SmtUtils]: Spent 362.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 50 [2020-09-04 21:58:24,586 WARN L193 SmtUtils]: Spent 225.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-09-04 21:58:24,723 WARN L193 SmtUtils]: Spent 134.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-09-04 21:58:24,976 WARN L193 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 49 [2020-09-04 21:58:25,200 WARN L193 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-09-04 21:58:25,494 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-04 21:58:25,870 WARN L193 SmtUtils]: Spent 338.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 49 [2020-09-04 21:58:26,245 WARN L193 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 51 [2020-09-04 21:58:26,667 WARN L193 SmtUtils]: Spent 397.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 50 [2020-09-04 21:58:26,810 WARN L193 SmtUtils]: Spent 140.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-09-04 21:58:27,192 WARN L193 SmtUtils]: Spent 375.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 52 [2020-09-04 21:58:27,442 WARN L193 SmtUtils]: Spent 246.00 ms on a formula simplification. DAG size of input: 62 DAG size of output: 42 [2020-09-04 21:58:27,786 WARN L193 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 47 DAG size of output: 29 [2020-09-04 21:58:28,135 WARN L193 SmtUtils]: Spent 262.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-09-04 21:58:28,447 WARN L193 SmtUtils]: Spent 233.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 40 [2020-09-04 21:58:28,668 WARN L193 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 38 [2020-09-04 21:58:28,935 WARN L193 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 43 [2020-09-04 21:58:29,162 WARN L193 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-09-04 21:58:29,496 WARN L193 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-04 21:58:29,803 WARN L193 SmtUtils]: Spent 295.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-04 21:58:30,002 WARN L193 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 34 [2020-09-04 21:58:30,113 WARN L193 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 25 [2020-09-04 21:58:30,437 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-04 21:58:30,662 WARN L193 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 40 [2020-09-04 21:58:31,021 WARN L193 SmtUtils]: Spent 294.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-04 21:58:31,357 WARN L193 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2020-09-04 21:58:31,596 WARN L193 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 56 DAG size of output: 35 [2020-09-04 21:58:31,895 WARN L193 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 71 DAG size of output: 43 [2020-09-04 21:58:31,914 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,915 INFO L271 CegarLoopResult]: At program point L-1-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,915 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,915 INFO L264 CegarLoopResult]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |old(#NULL.base)| |#NULL.base|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,915 INFO L271 CegarLoopResult]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,915 INFO L271 CegarLoopResult]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,916 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,916 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,916 INFO L271 CegarLoopResult]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2020-09-04 21:58:31,916 INFO L271 CegarLoopResult]: At program point assume_abort_if_notENTRY(lines 5 7) the Hoare annotation is: true [2020-09-04 21:58:31,916 INFO L271 CegarLoopResult]: At program point L6(line 6) the Hoare annotation is: true [2020-09-04 21:58:31,916 INFO L271 CegarLoopResult]: At program point L6-1(line 6) the Hoare annotation is: true [2020-09-04 21:58:31,917 INFO L271 CegarLoopResult]: At program point L6-3(lines 5 7) the Hoare annotation is: true [2020-09-04 21:58:31,917 INFO L271 CegarLoopResult]: At program point assume_abort_if_notEXIT(lines 5 7) the Hoare annotation is: true [2020-09-04 21:58:31,917 INFO L271 CegarLoopResult]: At program point mainEXIT(lines 38 52) the Hoare annotation is: true [2020-09-04 21:58:31,917 INFO L271 CegarLoopResult]: At program point L50(line 50) the Hoare annotation is: true [2020-09-04 21:58:31,917 INFO L264 CegarLoopResult]: At program point L48(line 48) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (<= main_~ai~1 main_~ax~1) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,917 INFO L271 CegarLoopResult]: At program point L48-1(line 48) the Hoare annotation is: true [2020-09-04 21:58:31,918 INFO L264 CegarLoopResult]: At program point L46(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,918 INFO L264 CegarLoopResult]: At program point L46-1(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0) (= |main_#t~mem12| 0))) [2020-09-04 21:58:31,918 INFO L271 CegarLoopResult]: At program point mainFINAL(lines 38 52) the Hoare annotation is: true [2020-09-04 21:58:31,918 INFO L264 CegarLoopResult]: At program point L44(line 44) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-09-04 21:58:31,918 INFO L264 CegarLoopResult]: At program point L46-2(line 46) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0) (= |main_#t~mem12| 0))) [2020-09-04 21:58:31,918 INFO L264 CegarLoopResult]: At program point L44-1(line 44) the Hoare annotation is: (= (select |#memory_int| |main_#t~malloc10.base|) ((as const (Array Int Int)) 0)) [2020-09-04 21:58:31,919 INFO L264 CegarLoopResult]: At program point L40(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,919 INFO L264 CegarLoopResult]: At program point L40-1(line 40) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,919 INFO L264 CegarLoopResult]: At program point mainENTRY(lines 38 52) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,919 INFO L264 CegarLoopResult]: At program point L47(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,919 INFO L264 CegarLoopResult]: At program point L47-1(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,919 INFO L264 CegarLoopResult]: At program point L45(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,919 INFO L264 CegarLoopResult]: At program point L47-2(line 47) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= |main_#t~mem13| 0) (= (select |#memory_int| main_~a~0.base) .cse0) (<= main_~ai~1 main_~ax~1) (= main_~ai~1 0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,920 INFO L264 CegarLoopResult]: At program point L45-1(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,920 INFO L264 CegarLoopResult]: At program point L43(line 43) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,920 INFO L264 CegarLoopResult]: At program point L45-2(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,920 INFO L264 CegarLoopResult]: At program point L43-1(line 43) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,920 INFO L264 CegarLoopResult]: At program point L45-3(line 45) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (and (= (select |#memory_int| main_~a~0.base) .cse0) (= (select |#memory_int| |main_#t~malloc10.base|) .cse0))) [2020-09-04 21:58:31,920 INFO L264 CegarLoopResult]: At program point L41(line 41) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,920 INFO L264 CegarLoopResult]: At program point L41-1(line 41) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,921 INFO L264 CegarLoopResult]: At program point L39(line 39) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,921 INFO L264 CegarLoopResult]: At program point L39-1(line 39) the Hoare annotation is: (and (= |#memory_int| |old(#memory_int)|) (= |old(#valid)| |#valid|)) [2020-09-04 21:58:31,921 INFO L264 CegarLoopResult]: At program point L33(line 33) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse3 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= check_~ax~0 0)) (.cse1 (= check_~ai~0 0)) (.cse2 (= (select |#memory_int| check_~a.base) .cse6)) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or (and .cse0 .cse1 .cse2) .cse3 (not (<= 1 |check_#in~x|)) .cse4) (or .cse3 (and .cse0 (or (let ((.cse5 (+ check_~y 1))) (and (<= .cse5 |check_#in~n|) (<= .cse5 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1 .cse2) (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 21:58:31,921 INFO L264 CegarLoopResult]: At program point L33-1(line 33) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (and (= check_~ax~0 0) (= check_~ai~0 0) (= (select |#memory_int| check_~a.base) .cse0)) (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)))) [2020-09-04 21:58:31,921 INFO L271 CegarLoopResult]: At program point checkENTRY(lines 14 36) the Hoare annotation is: true [2020-09-04 21:58:31,921 INFO L264 CegarLoopResult]: At program point L31(line 31) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,922 INFO L264 CegarLoopResult]: At program point L31-1(line 31) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse0 (= |check_#t~mem6| 0)) (.cse1 (= (select |#memory_int| check_~a.base) .cse5)) (.cse3 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (and .cse0 .cse1) .cse2 (not (<= 1 |check_#in~x|)) .cse3) (or .cse2 (and .cse0 (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse1) (not (= |check_#in~x| 0)) .cse3)))) [2020-09-04 21:58:31,922 INFO L264 CegarLoopResult]: At program point L31-2(line 31) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse2 (= |check_#t~mem6| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4 .cse5)) (or (and .cse2 .cse4 .cse5) .cse0 (not (<= 1 |check_#in~x|)) .cse1)))) [2020-09-04 21:58:31,922 INFO L264 CegarLoopResult]: At program point L27(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,922 INFO L264 CegarLoopResult]: At program point L27-1(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,922 INFO L264 CegarLoopResult]: At program point L25(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:31,922 INFO L264 CegarLoopResult]: At program point L27-2(line 27) the Hoare annotation is: (let ((.cse4 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (= (select |#memory_int| check_~a.base) .cse4)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse4)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 .cse2) (or .cse0 (and (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,922 INFO L264 CegarLoopResult]: At program point L25-1(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:31,923 INFO L264 CegarLoopResult]: At program point L25-2(line 25) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:31,923 INFO L264 CegarLoopResult]: At program point L19(line 19) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,923 INFO L264 CegarLoopResult]: At program point L15(line 15) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,923 INFO L264 CegarLoopResult]: At program point L15-1(line 15) the Hoare annotation is: (let ((.cse3 ((as const (Array Int Int)) 0)) (.cse5 (+ check_~y 1))) (let ((.cse1 (<= .cse5 |check_#in~n|)) (.cse2 (<= .cse5 check_~n)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse3)))) (and (or .cse0 (and .cse1 .cse2 (= (select |#memory_int| check_~a.base) .cse3) (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse4) (or (and .cse1 .cse2 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse4)))) [2020-09-04 21:58:31,923 INFO L264 CegarLoopResult]: At program point checkFINAL(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-09-04 21:58:31,923 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5))) (.cse2 (= check_~ai~0 0)) (.cse3 (= (select |#memory_int| check_~a.base) .cse5))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (and (or (let ((.cse4 (+ check_~y 1))) (and (<= .cse4 |check_#in~n|) (<= .cse4 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse2 .cse3))))) [2020-09-04 21:58:31,924 INFO L264 CegarLoopResult]: At program point L32-1(line 32) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0))) (let ((.cse1 (= |check_#t~mem7| 0)) (.cse3 (= check_~ai~0 0)) (.cse4 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse5 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and .cse1 (or (let ((.cse2 (+ check_~y 1))) (and (<= .cse2 |check_#in~n|) (<= .cse2 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse3 .cse4) (not (= |check_#in~x| 0)) .cse5) (or (and .cse1 .cse3 .cse4) .cse0 (not (<= 1 |check_#in~x|)) .cse5)))) [2020-09-04 21:58:31,924 INFO L264 CegarLoopResult]: At program point L32-2(line 32) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (= check_~ax~0 0)) (.cse2 (= |check_#t~mem7| 0)) (.cse4 (= check_~ai~0 0)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse6 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 (and .cse1 .cse2 (or (let ((.cse3 (+ check_~y 1))) (and (<= .cse3 |check_#in~n|) (<= .cse3 check_~n) (<= 1 check_~x))) (= check_~x 0)) .cse4 .cse5) (not (= |check_#in~x| 0)) .cse6) (or .cse0 (and .cse1 .cse2 .cse4 .cse5) (not (<= 1 |check_#in~x|)) .cse6)))) [2020-09-04 21:58:31,924 INFO L264 CegarLoopResult]: At program point L24(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,924 INFO L264 CegarLoopResult]: At program point L24-1(line 24) the Hoare annotation is: (let ((.cse8 ((as const (Array Int Int)) 0)) (.cse9 (+ check_~y 1))) (let ((.cse6 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse9 |check_#in~n|)) (.cse3 (<= .cse9 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse8)) (.cse5 (= |check_#t~mem1| 0)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse8)))) (and (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse2 .cse3 .cse4 .cse5 (<= 1 check_~x))) (or .cse0 .cse1 .cse6 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse7 (+ check_~y 2))) (and (<= .cse7 check_~n) (<= .cse7 |check_#in~n|))) .cse6) (or .cse0 (and .cse2 .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,924 INFO L264 CegarLoopResult]: At program point L22(line 22) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,925 INFO L264 CegarLoopResult]: At program point L24-2(lines 24 25) the Hoare annotation is: (let ((.cse10 (+ check_~y 1)) (.cse9 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse9))) (.cse3 (<= .cse10 |check_#in~n|)) (.cse4 (<= .cse10 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse9)) (.cse6 (= |check_#t~mem2| 0)) (.cse7 (= |check_#t~mem1| 0))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 .cse6 .cse7 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse8 (+ check_~y 2))) (and (<= .cse8 check_~n) (<= .cse8 |check_#in~n|))) .cse2) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (and .cse3 .cse4 .cse5 .cse6 .cse7 (<= 1 check_~x)))))) [2020-09-04 21:58:31,925 INFO L264 CegarLoopResult]: At program point L24-3(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7))) (.cse2 (not (<= 2 |check_#in~x|)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or .cse0 (and .cse3 .cse4 .cse5 (= |check_#t~mem2| 0) (= |check_#t~mem1| 0) (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2)))) [2020-09-04 21:58:31,925 INFO L264 CegarLoopResult]: At program point L24-4(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= |check_#t~mem1| 0) (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,925 INFO L264 CegarLoopResult]: At program point L24-5(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or .cse0 (and .cse3 .cse4 .cse5 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,925 INFO L264 CegarLoopResult]: At program point checkEXIT(lines 14 36) the Hoare annotation is: (let ((.cse0 ((as const (Array Int Int)) 0))) (or (not (<= (+ |check_#in~y| 1) |check_#in~n|)) (not (<= 1 |check_#in~x|)) (not (= (select |#memory_int| |check_#in~a.base|) .cse0)) (= (select |#memory_int| check_~a.base) .cse0))) [2020-09-04 21:58:31,926 INFO L264 CegarLoopResult]: At program point L18(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,926 INFO L264 CegarLoopResult]: At program point L24-6(line 24) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse4 (<= .cse8 |check_#in~n|)) (.cse5 (<= .cse8 check_~n)) (.cse6 (= (select |#memory_int| check_~a.base) .cse7)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse3 (+ check_~y 2))) (and (<= .cse3 check_~n) (<= .cse3 |check_#in~n|))) .cse2) (or .cse0 (not (<= 1 |check_#in~x|)) (and .cse4 (<= 1 |check_#t~post3|) .cse5 .cse6 (<= 1 check_~x)) .cse1) (or (and (= |check_#t~post3| 0) .cse4 .cse5 .cse6 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,926 INFO L264 CegarLoopResult]: At program point L18-1(line 18) the Hoare annotation is: (let ((.cse7 ((as const (Array Int Int)) 0)) (.cse8 (+ check_~y 1))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= .cse8 |check_#in~n|)) (.cse4 (<= .cse8 check_~n)) (.cse5 (= (select |#memory_int| check_~a.base) .cse7)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse7)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 .cse4 .cse5 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (let ((.cse6 (+ check_~y 2))) (and (<= .cse6 check_~n) (<= .cse6 |check_#in~n|))) .cse2) (or .cse0 (and .cse3 .cse4 .cse5 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1)))) [2020-09-04 21:58:31,926 INFO L264 CegarLoopResult]: At program point L24-7(line 24) the Hoare annotation is: (let ((.cse6 ((as const (Array Int Int)) 0)) (.cse7 (+ check_~y 1))) (let ((.cse1 (<= .cse7 |check_#in~n|)) (.cse2 (<= .cse7 check_~n)) (.cse3 (= (select |#memory_int| check_~a.base) .cse6)) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse4 (not (= (select |#memory_int| |check_#in~a.base|) .cse6)))) (and (or .cse0 (and (= |check_#t~post3| 0) .cse1 .cse2 .cse3 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse4) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse4 (let ((.cse5 (+ check_~y 2))) (and (<= .cse5 check_~n) (<= .cse5 |check_#in~n|))) (not (<= 2 |check_#in~x|))) (or (and .cse1 (<= 1 |check_#t~post3|) .cse2 .cse3 (<= 2 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse4)))) [2020-09-04 21:58:31,926 INFO L264 CegarLoopResult]: At program point L24-9(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:31,926 INFO L264 CegarLoopResult]: At program point L14(lines 14 36) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 (not (<= 2 |check_#in~x|)) (<= 2 check_~x)) (or .cse0 (not (= |check_#in~x| 0)) .cse1 (= check_~x 0)) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1 (<= 1 check_~x)))) [2020-09-04 21:58:31,927 INFO L264 CegarLoopResult]: At program point L24-10(line 24) the Hoare annotation is: (let ((.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (not (<= 1 |check_#in~x|)) .cse1))) [2020-09-04 21:58:31,927 INFO L264 CegarLoopResult]: At program point L14-1(lines 14 36) the Hoare annotation is: (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) ((as const (Array Int Int)) 0))))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (and .cse3 (<= 1 check_~x)) .cse0 (not (<= 1 |check_#in~x|)) .cse1) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 (<= (+ check_~y 2) |check_#in~n|) .cse2) (or .cse0 (and .cse3 (= check_~x 0)) (not (= |check_#in~x| 0)) .cse1))) [2020-09-04 21:58:31,927 INFO L264 CegarLoopResult]: At program point L24-11(lines 24 25) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0)) (.cse6 (+ check_~y 1))) (let ((.cse1 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse2 (<= .cse6 |check_#in~n|)) (.cse3 (<= .cse6 check_~n)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse0 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse0 (<= (+ check_~y 2) check_~n) (not (<= 2 |check_#in~x|))) (or .cse1 (and .cse2 .cse3 .cse4 (<= 2 check_~x)) (not (<= 1 |check_#in~x|)) .cse0) (or .cse1 (and .cse2 .cse3 .cse4 (<= 1 check_~x)) (not (= |check_#in~x| 0)) .cse0)))) [2020-09-04 21:58:31,927 INFO L264 CegarLoopResult]: At program point L14-2(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or (and .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-09-04 21:58:31,927 INFO L264 CegarLoopResult]: At program point L14-3(lines 14 36) the Hoare annotation is: (let ((.cse5 ((as const (Array Int Int)) 0))) (let ((.cse2 (not (<= 2 |check_#in~x|))) (.cse0 (not (<= (+ |check_#in~y| 1) |check_#in~n|))) (.cse3 (<= (+ check_~y 1) |check_#in~n|)) (.cse4 (= (select |#memory_int| check_~a.base) .cse5)) (.cse1 (not (= (select |#memory_int| |check_#in~a.base|) .cse5)))) (and (or .cse0 .cse1 .cse2 (<= 2 check_~x)) (or (not (<= (+ |check_#in~y| 2) |check_#in~n|)) .cse1 .cse2 (<= (+ check_~y 2) |check_#in~n|)) (or (and .cse3 .cse4 (= check_~x 0)) .cse0 (not (= |check_#in~x| 0)) .cse1) (or .cse0 (and .cse3 .cse4 (<= 1 check_~x)) (not (<= 1 |check_#in~x|)) .cse1)))) [2020-09-04 21:58:31,927 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 8 10) the Hoare annotation is: true [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertEXIT(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point L9(line 9) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point L9-1(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point L9-3(lines 8 10) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| 0) (not (= __VERIFIER_assert_~cond 0))) [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 9) the Hoare annotation is: (= |__VERIFIER_assert_#in~cond| 0) [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitENTRY(line -1) the Hoare annotation is: (= |#memory_int| |old(#memory_int)|) [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitEXIT(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-09-04 21:58:31,928 INFO L264 CegarLoopResult]: At program point #Ultimate.meminitFINAL(line -1) the Hoare annotation is: (= ((as const (Array Int Int)) 0) (select |#memory_int| |#Ultimate.meminit_#ptr.base|)) [2020-09-04 21:58:31,947 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.IllegalArgumentException: unknown symbol (const Int (Array Int Int)) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:165) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:394) at de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator.translateExpression(RCFGBacktranslator.java:1) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpression(ModelTranslationContainer.java:106) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateExpressionToString(ModelTranslationContainer.java:89) at de.uni_freiburg.informatik.ultimate.core.lib.results.ProcedureContractResult.getLongDescription(ProcedureContractResult.java:74) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportResult(TraceAbstractionStarter.java:693) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.createProcedureContractResults(TraceAbstractionStarter.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:218) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:127) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:120) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:317) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2020-09-04 21:58:31,952 INFO L168 Benchmark]: Toolchain (without parser) took 35119.21 ms. Allocated memory was 146.3 MB in the beginning and 427.3 MB in the end (delta: 281.0 MB). Free memory was 102.7 MB in the beginning and 339.1 MB in the end (delta: -236.4 MB). Peak memory consumption was 294.8 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:31,953 INFO L168 Benchmark]: CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2020-09-04 21:58:31,954 INFO L168 Benchmark]: CACSL2BoogieTranslator took 365.13 ms. Allocated memory is still 146.3 MB. Free memory was 102.5 MB in the beginning and 92.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:31,954 INFO L168 Benchmark]: Boogie Preprocessor took 123.89 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.0 MB in the beginning and 180.6 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:31,955 INFO L168 Benchmark]: RCFGBuilder took 491.53 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 157.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:31,956 INFO L168 Benchmark]: TraceAbstraction took 34133.17 ms. Allocated memory was 202.9 MB in the beginning and 427.3 MB in the end (delta: 224.4 MB). Free memory was 157.9 MB in the beginning and 339.1 MB in the end (delta: -181.2 MB). Peak memory consumption was 293.4 MB. Max. memory is 7.1 GB. [2020-09-04 21:58:31,960 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22 ms. Allocated memory is still 146.3 MB. Free memory was 121.8 MB in the beginning and 121.6 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 365.13 ms. Allocated memory is still 146.3 MB. Free memory was 102.5 MB in the beginning and 92.0 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 123.89 ms. Allocated memory was 146.3 MB in the beginning and 202.9 MB in the end (delta: 56.6 MB). Free memory was 92.0 MB in the beginning and 180.6 MB in the end (delta: -88.6 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 491.53 ms. Allocated memory is still 202.9 MB. Free memory was 180.6 MB in the beginning and 157.9 MB in the end (delta: 22.6 MB). Peak memory consumption was 22.6 MB. Max. memory is 7.1 GB. * TraceAbstraction took 34133.17 ms. Allocated memory was 202.9 MB in the beginning and 427.3 MB in the end (delta: 224.4 MB). Free memory was 157.9 MB in the beginning and 339.1 MB in the end (delta: -181.2 MB). Peak memory consumption was 293.4 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 9]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - ProcedureContractResult [Line: 5]: Procedure Contract for assume_abort_if_not Derived contract for procedure assume_abort_if_not: 1 - ProcedureContractResult [Line: 38]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 8]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == 0 || !(cond == 0) - ExceptionOrErrorResult: IllegalArgumentException: unknown symbol (const Int (Array Int Int)) de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: IllegalArgumentException: unknown symbol (const Int (Array Int Int)): de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.boogie.Term2Expression.translate(Term2Expression.java:238) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...