/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/loops/linear_search.c -------------------------------------------------------------------------------- This is Ultimate 0.2.1-dev-c225d54 [2021-05-02 11:49:54,255 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-05-02 11:49:54,258 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-05-02 11:49:54,294 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-05-02 11:49:54,295 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-05-02 11:49:54,298 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-05-02 11:49:54,301 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-05-02 11:49:54,306 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-05-02 11:49:54,308 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-05-02 11:49:54,313 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-05-02 11:49:54,314 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-05-02 11:49:54,318 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-05-02 11:49:54,318 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-05-02 11:49:54,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-05-02 11:49:54,322 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-05-02 11:49:54,324 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-05-02 11:49:54,326 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-05-02 11:49:54,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-05-02 11:49:54,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-05-02 11:49:54,335 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-05-02 11:49:54,337 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-05-02 11:49:54,338 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-05-02 11:49:54,339 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-05-02 11:49:54,341 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-05-02 11:49:54,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-05-02 11:49:54,348 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-05-02 11:49:54,349 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-05-02 11:49:54,350 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-05-02 11:49:54,351 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-05-02 11:49:54,352 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-05-02 11:49:54,352 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-05-02 11:49:54,352 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-05-02 11:49:54,354 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-05-02 11:49:54,354 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-05-02 11:49:54,355 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-05-02 11:49:54,356 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-05-02 11:49:54,356 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-05-02 11:49:54,356 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-05-02 11:49:54,357 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-05-02 11:49:54,371 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-05-02 11:49:54,371 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-05-02 11:49:54,375 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2021-05-02 11:49:54,414 INFO L113 SettingsManager]: Loading preferences was successful [2021-05-02 11:49:54,414 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-05-02 11:49:54,417 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-05-02 11:49:54,417 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-05-02 11:49:54,417 INFO L138 SettingsManager]: * Use SBE=true [2021-05-02 11:49:54,417 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-05-02 11:49:54,417 INFO L138 SettingsManager]: * sizeof long=4 [2021-05-02 11:49:54,418 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-05-02 11:49:54,418 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-05-02 11:49:54,418 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-05-02 11:49:54,419 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-05-02 11:49:54,419 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-05-02 11:49:54,419 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-05-02 11:49:54,419 INFO L138 SettingsManager]: * sizeof long double=12 [2021-05-02 11:49:54,419 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-05-02 11:49:54,419 INFO L138 SettingsManager]: * Use constant arrays=true [2021-05-02 11:49:54,420 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-05-02 11:49:54,420 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-05-02 11:49:54,420 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-05-02 11:49:54,420 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-05-02 11:49:54,420 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-05-02 11:49:54,421 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-05-02 11:49:54,421 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-05-02 11:49:54,421 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-05-02 11:49:54,421 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-05-02 11:49:54,421 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-05-02 11:49:54,421 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-05-02 11:49:54,421 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-05-02 11:49:54,421 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2021-05-02 11:49:54,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-05-02 11:49:54,773 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-05-02 11:49:54,775 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-05-02 11:49:54,776 INFO L271 PluginConnector]: Initializing CDTParser... [2021-05-02 11:49:54,777 INFO L275 PluginConnector]: CDTParser initialized [2021-05-02 11:49:54,778 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/loops/linear_search.c [2021-05-02 11:49:54,861 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4a21fbc/3302ce67405449bdab05bfd8c0378acd/FLAG1a8293761 [2021-05-02 11:49:55,232 INFO L306 CDTParser]: Found 1 translation units. [2021-05-02 11:49:55,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c [2021-05-02 11:49:55,237 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4a21fbc/3302ce67405449bdab05bfd8c0378acd/FLAG1a8293761 [2021-05-02 11:49:55,647 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9d4a21fbc/3302ce67405449bdab05bfd8c0378acd [2021-05-02 11:49:55,649 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-05-02 11:49:55,651 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2021-05-02 11:49:55,661 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-05-02 11:49:55,662 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-05-02 11:49:55,665 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-05-02 11:49:55,667 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,668 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c0a005d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55, skipping insertion in model container [2021-05-02 11:49:55,668 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,678 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-05-02 11:49:55,690 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-05-02 11:49:55,784 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[358,371] [2021-05-02 11:49:55,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:49:55,807 INFO L203 MainTranslator]: Completed pre-run [2021-05-02 11:49:55,818 WARN L224 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/loops/linear_search.c[358,371] [2021-05-02 11:49:55,824 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-05-02 11:49:55,836 INFO L208 MainTranslator]: Completed translation [2021-05-02 11:49:55,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55 WrapperNode [2021-05-02 11:49:55,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-05-02 11:49:55,838 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-05-02 11:49:55,838 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-05-02 11:49:55,838 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-05-02 11:49:55,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,851 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,883 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,883 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,889 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,893 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,894 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... [2021-05-02 11:49:55,896 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-05-02 11:49:55,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-05-02 11:49:55,913 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-05-02 11:49:55,913 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-05-02 11:49:55,914 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (1/1) ... No working directory specified, using /storage/repos/ultimate/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 [2021-05-02 11:49:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2021-05-02 11:49:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-05-02 11:49:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2021-05-02 11:49:55,993 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-05-02 11:49:55,994 INFO L138 BoogieDeclarations]: Found implementation of procedure linear_search [2021-05-02 11:49:55,994 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2021-05-02 11:49:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2021-05-02 11:49:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2021-05-02 11:49:55,994 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2021-05-02 11:49:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-05-02 11:49:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2021-05-02 11:49:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-05-02 11:49:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2021-05-02 11:49:55,995 INFO L130 BoogieDeclarations]: Found specification of procedure linear_search [2021-05-02 11:49:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-05-02 11:49:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure main [2021-05-02 11:49:55,997 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-05-02 11:49:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-05-02 11:49:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2021-05-02 11:49:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-05-02 11:49:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-05-02 11:49:55,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-05-02 11:49:56,296 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-05-02 11:49:56,296 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2021-05-02 11:49:56,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:49:56 BoogieIcfgContainer [2021-05-02 11:49:56,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-05-02 11:49:56,298 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-05-02 11:49:56,298 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-05-02 11:49:56,301 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-05-02 11:49:56,301 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.05 11:49:55" (1/3) ... [2021-05-02 11:49:56,302 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc70fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:49:56, skipping insertion in model container [2021-05-02 11:49:56,302 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.05 11:49:55" (2/3) ... [2021-05-02 11:49:56,303 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cc70fc8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.05 11:49:56, skipping insertion in model container [2021-05-02 11:49:56,303 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.05 11:49:56" (3/3) ... [2021-05-02 11:49:56,304 INFO L111 eAbstractionObserver]: Analyzing ICFG linear_search.c [2021-05-02 11:49:56,309 INFO L149 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-05-02 11:49:56,312 INFO L161 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2021-05-02 11:49:56,325 INFO L253 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-05-02 11:49:56,360 INFO L376 AbstractCegarLoop]: Interprodecural is true [2021-05-02 11:49:56,361 INFO L377 AbstractCegarLoop]: Hoare is true [2021-05-02 11:49:56,361 INFO L378 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-05-02 11:49:56,361 INFO L379 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-05-02 11:49:56,361 INFO L380 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-05-02 11:49:56,361 INFO L381 AbstractCegarLoop]: Difference is false [2021-05-02 11:49:56,361 INFO L382 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-05-02 11:49:56,361 INFO L386 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-05-02 11:49:56,379 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-05-02 11:49:56,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-05-02 11:49:56,384 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:49:56,385 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:49:56,385 INFO L428 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:49:56,393 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:49:56,394 INFO L82 PathProgramCache]: Analyzing trace with hash 796112175, now seen corresponding path program 1 times [2021-05-02 11:49:56,403 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:49:56,403 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089222039] [2021-05-02 11:49:56,403 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:49:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:56,703 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:49:56,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:56,735 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:49:56,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:56,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:56,754 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:49:56,754 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089222039] [2021-05-02 11:49:56,756 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089222039] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:49:56,756 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:49:56,756 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-05-02 11:49:56,757 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [336445251] [2021-05-02 11:49:56,761 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-05-02 11:49:56,762 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:49:56,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-05-02 11:49:56,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 11:49:56,777 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.4210526315789473) internal successors, (27), 20 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:56,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:49:56,860 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-05-02 11:49:56,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-05-02 11:49:56,862 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2021-05-02 11:49:56,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:49:56,868 INFO L225 Difference]: With dead ends: 45 [2021-05-02 11:49:56,868 INFO L226 Difference]: Without dead ends: 22 [2021-05-02 11:49:56,870 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 84.2ms TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-05-02 11:49:56,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-05-02 11:49:56,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-05-02 11:49:56,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:56,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2021-05-02 11:49:56,900 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 18 [2021-05-02 11:49:56,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:49:56,900 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2021-05-02 11:49:56,900 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:56,901 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2021-05-02 11:49:56,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 11:49:56,901 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:49:56,902 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:49:56,902 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-05-02 11:49:56,902 INFO L428 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:49:56,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:49:56,903 INFO L82 PathProgramCache]: Analyzing trace with hash 2121902114, now seen corresponding path program 1 times [2021-05-02 11:49:56,903 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:49:56,903 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924729202] [2021-05-02 11:49:56,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:49:56,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,004 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:49:57,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,025 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:49:57,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,068 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:57,068 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:49:57,069 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924729202] [2021-05-02 11:49:57,069 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [924729202] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:49:57,069 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:49:57,069 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-05-02 11:49:57,069 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121385987] [2021-05-02 11:49:57,071 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 11:49:57,071 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:49:57,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 11:49:57,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-05-02 11:49:57,072 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:57,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:49:57,326 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2021-05-02 11:49:57,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 11:49:57,327 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 20 [2021-05-02 11:49:57,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:49:57,328 INFO L225 Difference]: With dead ends: 30 [2021-05-02 11:49:57,328 INFO L226 Difference]: Without dead ends: 22 [2021-05-02 11:49:57,329 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 175.6ms TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2021-05-02 11:49:57,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2021-05-02 11:49:57,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2021-05-02 11:49:57,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.2) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:57,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 24 transitions. [2021-05-02 11:49:57,334 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 24 transitions. Word has length 20 [2021-05-02 11:49:57,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:49:57,335 INFO L480 AbstractCegarLoop]: Abstraction has 22 states and 24 transitions. [2021-05-02 11:49:57,335 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 5 states have internal predecessors, (14), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:57,335 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 24 transitions. [2021-05-02 11:49:57,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-05-02 11:49:57,335 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:49:57,336 INFO L523 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:49:57,336 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-05-02 11:49:57,336 INFO L428 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:49:57,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:49:57,337 INFO L82 PathProgramCache]: Analyzing trace with hash -430254847, now seen corresponding path program 1 times [2021-05-02 11:49:57,337 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:49:57,337 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029073086] [2021-05-02 11:49:57,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:49:57,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,476 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:49:57,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,485 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:49:57,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,602 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:57,603 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:49:57,603 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029073086] [2021-05-02 11:49:57,603 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2029073086] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:49:57,603 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:49:57,603 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-05-02 11:49:57,603 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60391737] [2021-05-02 11:49:57,604 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2021-05-02 11:49:57,604 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:49:57,604 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2021-05-02 11:49:57,604 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2021-05-02 11:49:57,604 INFO L87 Difference]: Start difference. First operand 22 states and 24 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:49:57,817 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2021-05-02 11:49:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 11:49:57,818 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 20 [2021-05-02 11:49:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:49:57,820 INFO L225 Difference]: With dead ends: 34 [2021-05-02 11:49:57,820 INFO L226 Difference]: Without dead ends: 25 [2021-05-02 11:49:57,822 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 204.3ms TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2021-05-02 11:49:57,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2021-05-02 11:49:57,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2021-05-02 11:49:57,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2021-05-02 11:49:57,839 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 20 [2021-05-02 11:49:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:49:57,839 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2021-05-02 11:49:57,839 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 3 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:57,839 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2021-05-02 11:49:57,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 11:49:57,841 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:49:57,841 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:49:57,841 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-05-02 11:49:57,841 INFO L428 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:49:57,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:49:57,842 INFO L82 PathProgramCache]: Analyzing trace with hash -434260005, now seen corresponding path program 1 times [2021-05-02 11:49:57,843 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:49:57,843 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644575489] [2021-05-02 11:49:57,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:49:57,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,955 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:49:57,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:57,966 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:49:57,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:58,025 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:58,026 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:49:58,026 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644575489] [2021-05-02 11:49:58,026 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644575489] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:49:58,026 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:49:58,027 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-05-02 11:49:58,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991871623] [2021-05-02 11:49:58,028 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-05-02 11:49:58,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:49:58,029 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-05-02 11:49:58,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:49:58,033 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:58,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:49:58,168 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2021-05-02 11:49:58,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-05-02 11:49:58,169 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 24 [2021-05-02 11:49:58,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:49:58,173 INFO L225 Difference]: With dead ends: 45 [2021-05-02 11:49:58,173 INFO L226 Difference]: Without dead ends: 32 [2021-05-02 11:49:58,174 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 101.0ms TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2021-05-02 11:49:58,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2021-05-02 11:49:58,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 26. [2021-05-02 11:49:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:58,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 29 transitions. [2021-05-02 11:49:58,183 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 29 transitions. Word has length 24 [2021-05-02 11:49:58,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:49:58,183 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 29 transitions. [2021-05-02 11:49:58,183 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:58,183 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 29 transitions. [2021-05-02 11:49:58,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-05-02 11:49:58,184 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:49:58,184 INFO L523 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:49:58,184 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-05-02 11:49:58,184 INFO L428 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:49:58,185 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:49:58,185 INFO L82 PathProgramCache]: Analyzing trace with hash -176094567, now seen corresponding path program 1 times [2021-05-02 11:49:58,185 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:49:58,185 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203733631] [2021-05-02 11:49:58,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:49:58,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:58,284 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:49:58,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:58,292 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:49:58,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:58,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:58,443 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:49:58,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203733631] [2021-05-02 11:49:58,443 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203733631] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:49:58,443 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1103059172] [2021-05-02 11:49:58,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:49:58,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:58,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 6 conjunts are in the unsatisfiable core [2021-05-02 11:49:58,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:49:58,724 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:58,724 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1103059172] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:49:58,725 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:49:58,725 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5] total 12 [2021-05-02 11:49:58,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371547289] [2021-05-02 11:49:58,726 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-05-02 11:49:58,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:49:58,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-05-02 11:49:58,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 11:49:58,727 INFO L87 Difference]: Start difference. First operand 26 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 11:49:58,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:49:58,994 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2021-05-02 11:49:58,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 11:49:58,995 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2021-05-02 11:49:58,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:49:58,997 INFO L225 Difference]: With dead ends: 38 [2021-05-02 11:49:58,999 INFO L226 Difference]: Without dead ends: 29 [2021-05-02 11:49:59,000 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 24 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 276.3ms TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2021-05-02 11:49:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2021-05-02 11:49:59,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2021-05-02 11:49:59,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:59,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 33 transitions. [2021-05-02 11:49:59,012 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 33 transitions. Word has length 24 [2021-05-02 11:49:59,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:49:59,017 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 33 transitions. [2021-05-02 11:49:59,018 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 12 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 11 states have internal predecessors, (29), 3 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2021-05-02 11:49:59,018 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 33 transitions. [2021-05-02 11:49:59,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 11:49:59,019 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:49:59,019 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:49:59,231 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:49:59,231 INFO L428 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:49:59,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:49:59,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1958959475, now seen corresponding path program 1 times [2021-05-02 11:49:59,232 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:49:59,232 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [97333215] [2021-05-02 11:49:59,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:49:59,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:59,278 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:49:59,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:59,282 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:49:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:59,327 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:59,327 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:49:59,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [97333215] [2021-05-02 11:49:59,327 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [97333215] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:49:59,327 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1952465742] [2021-05-02 11:49:59,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:49:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:49:59,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 8 conjunts are in the unsatisfiable core [2021-05-02 11:49:59,388 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:49:59,450 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:49:59,455 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:49:59,481 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:49:59,481 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1952465742] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:49:59,482 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:49:59,482 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5] total 7 [2021-05-02 11:49:59,482 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828144811] [2021-05-02 11:49:59,482 INFO L460 AbstractCegarLoop]: Interpolant automaton has 7 states [2021-05-02 11:49:59,482 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:49:59,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-05-02 11:49:59,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2021-05-02 11:49:59,483 INFO L87 Difference]: Start difference. First operand 29 states and 33 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:59,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:49:59,683 INFO L93 Difference]: Finished difference Result 49 states and 58 transitions. [2021-05-02 11:49:59,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-05-02 11:49:59,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-05-02 11:49:59,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:49:59,685 INFO L225 Difference]: With dead ends: 49 [2021-05-02 11:49:59,685 INFO L226 Difference]: Without dead ends: 36 [2021-05-02 11:49:59,686 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 154.7ms TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2021-05-02 11:49:59,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2021-05-02 11:49:59,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2021-05-02 11:49:59,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 23 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:49:59,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2021-05-02 11:49:59,695 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 28 [2021-05-02 11:49:59,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:49:59,696 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2021-05-02 11:49:59,696 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 6 states have internal predecessors, (25), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:49:59,696 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2021-05-02 11:49:59,696 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 11:49:59,696 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:49:59,697 INFO L523 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:49:59,912 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:49:59,913 INFO L428 AbstractCegarLoop]: === Iteration 7 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:49:59,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:49:59,913 INFO L82 PathProgramCache]: Analyzing trace with hash -2077842383, now seen corresponding path program 2 times [2021-05-02 11:49:59,913 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:49:59,914 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [987663540] [2021-05-02 11:49:59,914 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:49:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:00,007 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:00,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:00,012 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:50:00,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:00,145 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-02 11:50:00,145 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:00,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [987663540] [2021-05-02 11:50:00,146 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [987663540] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:00,146 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685043734] [2021-05-02 11:50:00,146 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:00,237 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2021-05-02 11:50:00,237 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:50:00,238 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2021-05-02 11:50:00,240 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:50:00,416 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:00,502 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:00,521 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2021-05-02 11:50:00,521 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685043734] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:00,521 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:50:00,521 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2021-05-02 11:50:00,522 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1357728874] [2021-05-02 11:50:00,522 INFO L460 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-05-02 11:50:00,523 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:00,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-05-02 11:50:00,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2021-05-02 11:50:00,523 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:50:00,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:00,899 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2021-05-02 11:50:00,900 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-05-02 11:50:00,900 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2021-05-02 11:50:00,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:00,901 INFO L225 Difference]: With dead ends: 42 [2021-05-02 11:50:00,902 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 11:50:00,902 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 488.1ms TimeCoverageRelationStatistics Valid=115, Invalid=305, Unknown=0, NotChecked=0, Total=420 [2021-05-02 11:50:00,902 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 11:50:00,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2021-05-02 11:50:00,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:50:00,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2021-05-02 11:50:00,912 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 28 [2021-05-02 11:50:00,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:00,914 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2021-05-02 11:50:00,914 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 14 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 13 states have internal predecessors, (32), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:50:00,914 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2021-05-02 11:50:00,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 11:50:00,916 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:00,916 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:01,139 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:01,139 INFO L428 AbstractCegarLoop]: === Iteration 8 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:01,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:01,140 INFO L82 PathProgramCache]: Analyzing trace with hash 1824097903, now seen corresponding path program 1 times [2021-05-02 11:50:01,140 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:01,140 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29321831] [2021-05-02 11:50:01,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:01,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:01,335 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:01,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:01,354 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:50:01,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:02,001 WARN L205 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 52 [2021-05-02 11:50:02,203 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:02,203 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:02,203 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29321831] [2021-05-02 11:50:02,204 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29321831] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:02,204 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1940134304] [2021-05-02 11:50:02,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:02,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:02,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 27 conjunts are in the unsatisfiable core [2021-05-02 11:50:02,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:50:02,337 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,341 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,344 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,345 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,377 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-05-02 11:50:02,378 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 11:50:02,395 INFO L628 ElimStorePlain]: treesize reduction 47, result has 32.9 percent of original size [2021-05-02 11:50:02,395 INFO L518 ElimStorePlain]: Eliminatee |v_#memory_int_7| vanished before elimination [2021-05-02 11:50:02,396 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 11:50:02,396 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:74, output treesize:23 [2021-05-02 11:50:02,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,439 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,486 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,489 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,491 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,497 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,546 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,550 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,554 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,555 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,557 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,560 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,562 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,564 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,567 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,569 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,571 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,573 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,628 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,630 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,635 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,638 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,644 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,656 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,812 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,814 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,820 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,868 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,869 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,882 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,884 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,885 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,887 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,889 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,890 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,892 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,893 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,895 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,897 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,898 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,900 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,903 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,904 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,907 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,908 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,955 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,957 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,958 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,961 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,962 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,965 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,973 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:02,986 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:02,986 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1940134304] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:02,986 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:50:02,986 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9] total 21 [2021-05-02 11:50:02,987 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103718298] [2021-05-02 11:50:02,987 INFO L460 AbstractCegarLoop]: Interpolant automaton has 21 states [2021-05-02 11:50:02,987 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:02,988 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2021-05-02 11:50:02,988 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2021-05-02 11:50:02,988 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:50:03,651 WARN L205 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 81 [2021-05-02 11:50:03,853 WARN L205 SmtUtils]: Spent 170.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 92 [2021-05-02 11:50:04,130 WARN L205 SmtUtils]: Spent 209.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 95 [2021-05-02 11:50:04,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:04,535 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2021-05-02 11:50:04,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2021-05-02 11:50:04,535 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2021-05-02 11:50:04,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:04,537 INFO L225 Difference]: With dead ends: 46 [2021-05-02 11:50:04,537 INFO L226 Difference]: Without dead ends: 37 [2021-05-02 11:50:04,538 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 23 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 2235.8ms TimeCoverageRelationStatistics Valid=176, Invalid=754, Unknown=0, NotChecked=0, Total=930 [2021-05-02 11:50:04,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2021-05-02 11:50:04,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2021-05-02 11:50:04,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:50:04,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2021-05-02 11:50:04,544 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 28 [2021-05-02 11:50:04,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:04,544 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2021-05-02 11:50:04,544 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 19 states have internal predecessors, (40), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:50:04,544 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2021-05-02 11:50:04,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-05-02 11:50:04,545 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:04,545 INFO L523 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:04,768 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:04,769 INFO L428 AbstractCegarLoop]: === Iteration 9 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:04,769 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:04,769 INFO L82 PathProgramCache]: Analyzing trace with hash 812980653, now seen corresponding path program 2 times [2021-05-02 11:50:04,769 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:04,769 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1685096724] [2021-05-02 11:50:04,770 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:04,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:04,809 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:04,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:04,817 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:50:04,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:04,829 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-05-02 11:50:04,830 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:04,830 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1685096724] [2021-05-02 11:50:04,830 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1685096724] provided 1 perfect and 0 imperfect interpolant sequences [2021-05-02 11:50:04,830 INFO L226 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-05-02 11:50:04,830 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-05-02 11:50:04,830 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1086034361] [2021-05-02 11:50:04,831 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-05-02 11:50:04,831 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:04,831 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-05-02 11:50:04,831 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-05-02 11:50:04,831 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:50:04,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:04,904 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2021-05-02 11:50:04,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-05-02 11:50:04,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 28 [2021-05-02 11:50:04,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:04,907 INFO L225 Difference]: With dead ends: 59 [2021-05-02 11:50:04,907 INFO L226 Difference]: Without dead ends: 33 [2021-05-02 11:50:04,907 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 44.8ms TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-05-02 11:50:04,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2021-05-02 11:50:04,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2021-05-02 11:50:04,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 26 states have internal predecessors, (28), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:50:04,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2021-05-02 11:50:04,919 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2021-05-02 11:50:04,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:04,919 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2021-05-02 11:50:04,919 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 4 states, 4 states have (on average 5.25) internal successors, (21), 3 states have internal predecessors, (21), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:50:04,919 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2021-05-02 11:50:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 11:50:04,923 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:04,923 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:04,924 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-05-02 11:50:04,924 INFO L428 AbstractCegarLoop]: === Iteration 10 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:04,924 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:04,924 INFO L82 PathProgramCache]: Analyzing trace with hash -157200055, now seen corresponding path program 1 times [2021-05-02 11:50:04,924 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:04,924 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [647087534] [2021-05-02 11:50:04,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:04,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:04,978 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:04,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:04,984 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:50:04,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:05,043 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:05,076 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:05,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [647087534] [2021-05-02 11:50:05,078 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [647087534] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:05,078 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [178817746] [2021-05-02 11:50:05,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:05,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:05,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 10 conjunts are in the unsatisfiable core [2021-05-02 11:50:05,139 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:50:05,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:05,197 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:05,211 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:05,211 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [178817746] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:05,211 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:50:05,211 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 8 [2021-05-02 11:50:05,211 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239153943] [2021-05-02 11:50:05,212 INFO L460 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-05-02 11:50:05,212 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:05,212 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-05-02 11:50:05,212 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-05-02 11:50:05,212 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:50:05,446 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:05,446 INFO L93 Difference]: Finished difference Result 56 states and 60 transitions. [2021-05-02 11:50:05,447 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-05-02 11:50:05,447 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 32 [2021-05-02 11:50:05,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:05,447 INFO L225 Difference]: With dead ends: 56 [2021-05-02 11:50:05,447 INFO L226 Difference]: Without dead ends: 42 [2021-05-02 11:50:05,448 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 173.8ms TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2021-05-02 11:50:05,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-02 11:50:05,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 35. [2021-05-02 11:50:05,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 28 states have (on average 1.0714285714285714) internal successors, (30), 28 states have internal predecessors, (30), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:50:05,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 36 transitions. [2021-05-02 11:50:05,453 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 36 transitions. Word has length 32 [2021-05-02 11:50:05,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:05,453 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 36 transitions. [2021-05-02 11:50:05,453 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 8 states, 8 states have (on average 3.625) internal successors, (29), 7 states have internal predecessors, (29), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:50:05,453 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 36 transitions. [2021-05-02 11:50:05,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2021-05-02 11:50:05,453 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:05,454 INFO L523 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:05,664 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2021-05-02 11:50:05,665 INFO L428 AbstractCegarLoop]: === Iteration 11 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:05,665 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:05,665 INFO L82 PathProgramCache]: Analyzing trace with hash 100965383, now seen corresponding path program 3 times [2021-05-02 11:50:05,665 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:05,665 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1400675884] [2021-05-02 11:50:05,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:05,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:05,907 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:05,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:05,924 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:50:05,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:06,972 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:06,972 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:06,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1400675884] [2021-05-02 11:50:06,972 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1400675884] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:06,972 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056076974] [2021-05-02 11:50:06,972 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:07,092 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2021-05-02 11:50:07,092 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:50:07,103 INFO L263 TraceCheckSpWp]: Trace formula consists of 177 conjuncts, 37 conjunts are in the unsatisfiable core [2021-05-02 11:50:07,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:50:07,135 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,145 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,146 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,159 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-05-02 11:50:07,160 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 11:50:07,184 INFO L628 ElimStorePlain]: treesize reduction 68, result has 34.6 percent of original size [2021-05-02 11:50:07,184 INFO L518 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2021-05-02 11:50:07,185 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 11:50:07,185 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:108, output treesize:36 [2021-05-02 11:50:07,243 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,244 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,246 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,248 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,250 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,296 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,298 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,300 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,302 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,303 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,355 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,358 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,361 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,365 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,367 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,480 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,483 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,485 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,487 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,543 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,545 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,547 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,548 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,553 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,619 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,620 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,622 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,624 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,625 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,627 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,629 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,631 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,634 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,636 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,794 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 49 [2021-05-02 11:50:07,796 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,799 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,802 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,808 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,811 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,992 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,995 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:07,998 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,000 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,002 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,060 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,061 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,062 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,078 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,080 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,082 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,083 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,085 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,087 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,092 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,094 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,095 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,097 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,100 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,102 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,104 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,107 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,108 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,194 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,261 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,264 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,265 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,274 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,283 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,287 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,288 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,418 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,419 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,421 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,422 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,423 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,424 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,430 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,432 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,433 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,435 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,436 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,437 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,518 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,552 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:08,569 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:08,570 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056076974] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:08,570 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:50:08,570 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 15] total 31 [2021-05-02 11:50:08,570 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102770202] [2021-05-02 11:50:08,570 INFO L460 AbstractCegarLoop]: Interpolant automaton has 31 states [2021-05-02 11:50:08,570 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:08,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2021-05-02 11:50:08,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=847, Unknown=0, NotChecked=0, Total=930 [2021-05-02 11:50:08,571 INFO L87 Difference]: Start difference. First operand 35 states and 36 transitions. Second operand has 31 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:50:09,284 WARN L205 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 84 [2021-05-02 11:50:09,552 WARN L205 SmtUtils]: Spent 192.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 93 [2021-05-02 11:50:09,722 WARN L205 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2021-05-02 11:50:09,891 WARN L205 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 86 [2021-05-02 11:50:10,193 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2021-05-02 11:50:10,454 WARN L205 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 98 [2021-05-02 11:50:10,638 WARN L205 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 92 [2021-05-02 11:50:10,938 WARN L205 SmtUtils]: Spent 199.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 105 [2021-05-02 11:50:11,214 WARN L205 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 140 DAG size of output: 102 [2021-05-02 11:50:11,448 WARN L205 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 111 DAG size of output: 88 [2021-05-02 11:50:11,753 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 138 DAG size of output: 82 [2021-05-02 11:50:11,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:11,893 INFO L93 Difference]: Finished difference Result 48 states and 49 transitions. [2021-05-02 11:50:11,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2021-05-02 11:50:11,894 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2021-05-02 11:50:11,894 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:11,895 INFO L225 Difference]: With dead ends: 48 [2021-05-02 11:50:11,895 INFO L226 Difference]: Without dead ends: 38 [2021-05-02 11:50:11,895 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 20 SyntacticMatches, 4 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 4810.3ms TimeCoverageRelationStatistics Valid=285, Invalid=1877, Unknown=0, NotChecked=0, Total=2162 [2021-05-02 11:50:11,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2021-05-02 11:50:11,900 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2021-05-02 11:50:11,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 30 states have internal predecessors, (32), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:50:11,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 38 transitions. [2021-05-02 11:50:11,901 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 38 transitions. Word has length 32 [2021-05-02 11:50:11,901 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:11,902 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 38 transitions. [2021-05-02 11:50:11,902 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 31 states, 29 states have (on average 1.6206896551724137) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (7), 6 states have call predecessors, (7), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:50:11,902 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 38 transitions. [2021-05-02 11:50:11,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-05-02 11:50:11,902 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:11,902 INFO L523 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:12,104 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:12,105 INFO L428 AbstractCegarLoop]: === Iteration 12 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:12,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:12,106 INFO L82 PathProgramCache]: Analyzing trace with hash 582474465, now seen corresponding path program 2 times [2021-05-02 11:50:12,106 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:12,106 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455324812] [2021-05-02 11:50:12,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:12,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:12,150 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:12,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:12,156 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:50:12,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:12,218 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:12,218 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:12,218 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455324812] [2021-05-02 11:50:12,218 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455324812] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:12,219 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2100225784] [2021-05-02 11:50:12,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:12,293 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-05-02 11:50:12,293 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:50:12,294 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 12 conjunts are in the unsatisfiable core [2021-05-02 11:50:12,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:50:12,364 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:12,366 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:12,380 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:12,381 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2100225784] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:12,381 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:50:12,381 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 9 [2021-05-02 11:50:12,381 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [60795322] [2021-05-02 11:50:12,382 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2021-05-02 11:50:12,382 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:12,382 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2021-05-02 11:50:12,383 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2021-05-02 11:50:12,383 INFO L87 Difference]: Start difference. First operand 37 states and 38 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:50:12,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:50:12,677 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2021-05-02 11:50:12,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-05-02 11:50:12,677 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2021-05-02 11:50:12,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:50:12,678 INFO L225 Difference]: With dead ends: 60 [2021-05-02 11:50:12,678 INFO L226 Difference]: Without dead ends: 46 [2021-05-02 11:50:12,678 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 220.5ms TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2021-05-02 11:50:12,679 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2021-05-02 11:50:12,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 39. [2021-05-02 11:50:12,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 32 states have (on average 1.0625) internal successors, (34), 32 states have internal predecessors, (34), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:50:12,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2021-05-02 11:50:12,690 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 36 [2021-05-02 11:50:12,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:50:12,691 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2021-05-02 11:50:12,691 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 8 states have internal predecessors, (33), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:50:12,691 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2021-05-02 11:50:12,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2021-05-02 11:50:12,692 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:50:12,692 INFO L523 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:50:12,900 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:12,901 INFO L428 AbstractCegarLoop]: === Iteration 13 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:50:12,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:50:12,901 INFO L82 PathProgramCache]: Analyzing trace with hash 840639903, now seen corresponding path program 4 times [2021-05-02 11:50:12,901 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:50:12,901 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [988228095] [2021-05-02 11:50:12,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:50:12,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:13,122 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:50:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:13,149 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:50:13,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:50:14,730 WARN L205 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 87 [2021-05-02 11:50:15,513 WARN L205 SmtUtils]: Spent 370.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 88 [2021-05-02 11:50:17,168 WARN L205 SmtUtils]: Spent 1.50 s on a formula simplification. DAG size of input: 111 DAG size of output: 106 [2021-05-02 11:50:22,818 WARN L205 SmtUtils]: Spent 4.59 s on a formula simplification. DAG size of input: 109 DAG size of output: 105 [2021-05-02 11:50:33,774 WARN L205 SmtUtils]: Spent 4.89 s on a formula simplification. DAG size of input: 104 DAG size of output: 98 [2021-05-02 11:50:41,543 WARN L205 SmtUtils]: Spent 460.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2021-05-02 11:50:43,581 WARN L205 SmtUtils]: Spent 130.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 76 [2021-05-02 11:50:43,955 WARN L205 SmtUtils]: Spent 160.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 79 [2021-05-02 11:50:43,957 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:43,958 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:50:43,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [988228095] [2021-05-02 11:50:43,958 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [988228095] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:43,958 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1870148545] [2021-05-02 11:50:43,958 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:50:44,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-05-02 11:50:44,121 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:50:44,122 INFO L263 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 40 conjunts are in the unsatisfiable core [2021-05-02 11:50:44,124 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:50:44,137 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,139 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,140 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,143 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,144 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,151 INFO L388 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2021-05-02 11:50:44,152 INFO L550 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-05-02 11:50:44,171 INFO L628 ElimStorePlain]: treesize reduction 52, result has 35.0 percent of original size [2021-05-02 11:50:44,172 INFO L518 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2021-05-02 11:50:44,172 INFO L550 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-05-02 11:50:44,172 INFO L247 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:84, output treesize:28 [2021-05-02 11:50:44,403 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,404 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,405 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,407 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,408 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,612 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,613 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,615 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,617 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:44,618 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,181 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,182 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,183 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,185 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,186 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,187 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,189 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,190 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,192 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,193 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,195 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,196 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,198 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,199 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,201 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,425 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,426 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,427 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,428 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,429 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,431 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,441 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,443 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,446 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,448 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,633 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,639 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,642 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,649 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:45,654 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,224 WARN L205 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 47 [2021-05-02 11:50:46,226 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,228 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,230 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,232 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,233 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,475 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,476 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,479 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,481 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,482 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,816 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,818 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,819 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,821 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,822 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,824 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,827 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,831 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,836 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:46,841 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,658 WARN L205 SmtUtils]: Spent 127.00 ms on a formula simplification. DAG size of input: 59 DAG size of output: 48 [2021-05-02 11:50:47,660 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,662 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,663 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,674 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,676 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,859 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,860 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,861 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,863 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,864 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,865 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,866 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,867 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,871 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,872 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,873 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,874 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,875 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,877 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,878 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,879 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,880 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,881 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,883 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:47,886 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,098 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,099 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,101 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,103 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,105 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,208 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,213 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,214 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,217 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,224 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,227 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,242 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,495 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,496 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,512 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,514 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,515 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,516 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,517 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,519 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,520 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,521 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,522 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,524 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,525 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,527 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,528 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,701 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,702 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,703 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,705 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,706 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,708 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,726 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:50:48,743 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:50:48,743 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1870148545] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:50:48,743 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:50:48,743 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 14] total 32 [2021-05-02 11:50:48,743 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387681818] [2021-05-02 11:50:48,743 INFO L460 AbstractCegarLoop]: Interpolant automaton has 32 states [2021-05-02 11:50:48,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:50:48,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2021-05-02 11:50:48,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=910, Unknown=2, NotChecked=0, Total=992 [2021-05-02 11:50:48,745 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 29 states have internal predecessors, (56), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:50:49,448 WARN L205 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 76 [2021-05-02 11:50:49,699 WARN L205 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 75 [2021-05-02 11:50:50,097 WARN L205 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 84 [2021-05-02 11:50:50,454 WARN L205 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 90 [2021-05-02 11:50:50,712 WARN L205 SmtUtils]: Spent 165.00 ms on a formula simplification. DAG size of input: 107 DAG size of output: 97 [2021-05-02 11:50:51,448 WARN L205 SmtUtils]: Spent 220.00 ms on a formula simplification. DAG size of input: 129 DAG size of output: 120 [2021-05-02 11:50:52,237 WARN L205 SmtUtils]: Spent 368.00 ms on a formula simplification. DAG size of input: 152 DAG size of output: 122 [2021-05-02 11:50:52,946 WARN L205 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 163 DAG size of output: 135 [2021-05-02 11:50:53,724 WARN L205 SmtUtils]: Spent 554.00 ms on a formula simplification. DAG size of input: 220 DAG size of output: 157 [2021-05-02 11:50:58,310 WARN L205 SmtUtils]: Spent 2.03 s on a formula simplification. DAG size of input: 312 DAG size of output: 151 [2021-05-02 11:50:59,172 WARN L205 SmtUtils]: Spent 304.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 125 [2021-05-02 11:51:00,945 WARN L205 SmtUtils]: Spent 1.36 s on a formula simplification. DAG size of input: 205 DAG size of output: 146 [2021-05-02 11:51:15,058 WARN L205 SmtUtils]: Spent 1.14 s on a formula simplification. DAG size of input: 230 DAG size of output: 122 [2021-05-02 11:51:17,320 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse25 (div c_linear_search_~j~0 4294967296))) (let ((.cse33 (div (+ c_linear_search_~j~0 4294967291) 4294967296)) (.cse26 (* .cse25 4294967296)) (.cse27 (* |c_linear_search_#in~a.offset| (- 2))) (.cse28 (* c_linear_search_~j~0 (- 1)))) (let ((.cse17 (* .cse25 (- 8589934592))) (.cse18 (* c_linear_search_~j~0 2)) (.cse19 (* |c_linear_search_#in~a.offset| (- 4))) (.cse31 (div (+ .cse26 .cse27 .cse28 (* |c_linear_search_#in~n| 2)) 2)) (.cse23 (* .cse33 8589934592)) (.cse30 (div (+ |c_linear_search_#in~n| 4294967288) 4294967296))) (let ((.cse29 (mod c_~SIZE~0 4294967296)) (.cse2 (* .cse25 2147483648)) (.cse4 (* |c_linear_search_#in~a.offset| 2)) (.cse13 (* 2 c_linear_search_~j~0)) (.cse14 (* 8589934592 .cse33)) (.cse15 (* 8589934592 .cse25)) (.cse16 (* 4 |c_linear_search_#in~a.offset|)) (.cse32 (div (+ .cse17 .cse18 .cse19 (* .cse31 (- 4)) .cse23 (* .cse30 17179869184) 8589934591) 8589934592)) (.cse7 (select |c_#memory_int| |c_linear_search_#in~a.base|)) (.cse8 (* .cse25 8589934592)) (.cse9 (* |c_linear_search_#in~a.offset| 5)) (.cse12 (* .cse33 (- 8589934592)))) (and (= c_~MAX~0 |c_old(~MAX~0)|) (= |c_#t~string5.offset| |c_old(#t~string5.offset)|) (= c_linear_search_~j~0 4) (= |c_old(#length)| |c_#length|) (let ((.cse1 (div (+ .cse26 .cse27 .cse28) 2)) (.cse10 (div (+ (* .cse25 (- 4294967296)) c_linear_search_~j~0 4294967288) 4294967296)) (.cse11 (div c_linear_search_~n 4294967296))) (let ((.cse0 (+ (* 8589934592 .cse10) (* 4294967296 .cse11) 2)) (.cse3 (* .cse1 2)) (.cse5 (* .cse11 (- 4294967296))) (.cse20 (* .cse1 (- 4))) (.cse21 (* .cse10 17179869184)) (.cse22 (* .cse11 17179869184)) (.cse24 (* c_linear_search_~n (- 4)))) (or (let ((.cse6 (div (+ .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 8589934591) 8589934592))) (and (<= .cse0 (+ .cse1 |c_linear_search_#in~a.offset| c_linear_search_~n (* 4294967296 (div (+ .cse2 .cse3 .cse4 .cse5 (* .cse6 (- 2147483648)) c_linear_search_~n 1) 4294967296)))) (or (not (= (select .cse7 (+ .cse8 (* .cse1 4) .cse9 (* .cse10 (- 17179869184)) (* .cse11 (- 17179869184)) .cse12 (* c_linear_search_~n 4))) |c_linear_search_#in~q|)) (< (+ .cse13 (* 17179869184 .cse10) (* 17179869184 .cse11) .cse14) (+ .cse15 .cse16 (* 4 .cse1) (* 8589934592 .cse6) (* 4 c_linear_search_~n)))))) (<= .cse0 (+ .cse1 |c_linear_search_#in~a.offset| c_linear_search_~n (* 4294967296 (div (+ .cse2 .cse3 .cse4 .cse5 c_linear_search_~n (* (div (+ .cse17 .cse18 .cse19 .cse20 .cse21 .cse22 .cse23 .cse24 17179869183) 8589934592) (- 2147483648)) 1) 4294967296))))))) (= |c_#t~string6.base| |c_old(#t~string6.base)|) (= c_~SIZE~0 |c_old(~SIZE~0)|) (exists ((v_main_~a~0.offset_BEFORE_CALL_3 Int) (v_main_~a~0.base_BEFORE_CALL_3 Int)) (= (select (select |c_#memory_int| v_main_~a~0.base_BEFORE_CALL_3) (+ (* (mod (div (mod c_~SIZE~0 4294967296) 2) 4294967296) 4) v_main_~a~0.offset_BEFORE_CALL_3)) 3)) (not (= (select .cse7 (+ |c_linear_search_#in~a.offset| 8)) |c_linear_search_#in~q|)) (= |c_#t~string4.offset| |c_old(#t~string4.offset)|) (= |c_linear_search_#in~n| c_linear_search_~n) (= |c_old(#valid)| |c_#valid|) (= |c_#t~string5.base| |c_old(#t~string5.base)|) (< 1 .cse29) (= |c_#t~string4.base| |c_old(#t~string4.base)|) (= |c_#NULL.base| |c_old(#NULL.base)|) (< .cse29 4294967295) (<= (+ (* 8589934592 .cse30) 2) (+ |c_linear_search_#in~a.offset| .cse31 (* 4294967296 (div (+ .cse2 .cse4 (* .cse31 2) (* |c_linear_search_#in~n| (- 1)) (* .cse32 (- 2147483648)) 1) 4294967296)))) (< 1 (mod c_linear_search_~n 4294967296)) (= |c_#t~string6.offset| |c_old(#t~string6.offset)|) (not (= (select .cse7 (+ |c_linear_search_#in~a.offset| 4)) |c_linear_search_#in~q|)) (<= 100000 c_~MAX~0) (or (< (+ .cse13 .cse14 (* 17179869184 .cse30)) (+ .cse15 .cse16 (* 4 .cse31) (* 8589934592 .cse32))) (not (= (select .cse7 (+ .cse8 .cse9 (* .cse31 4) .cse12 (* .cse30 (- 17179869184)))) |c_linear_search_#in~q|))) (<= c_~SIZE~0 2147483648) (< 0 (+ (div c_~MAX~0 4294967296) 1)) (<= c_~MAX~0 100000) (<= 1 c_~SIZE~0) (= |c_#NULL.offset| |c_old(#NULL.offset)|)))))) is different from false [2021-05-02 11:51:18,047 WARN L205 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 93 [2021-05-02 11:51:18,253 WARN L205 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 105 [2021-05-02 11:51:18,441 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:18,441 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2021-05-02 11:51:18,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2021-05-02 11:51:18,442 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 29 states have internal predecessors, (56), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 36 [2021-05-02 11:51:18,442 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:18,442 INFO L225 Difference]: With dead ends: 52 [2021-05-02 11:51:18,442 INFO L226 Difference]: Without dead ends: 42 [2021-05-02 11:51:18,444 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 24 SyntacticMatches, 7 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 61148.7ms TimeCoverageRelationStatistics Valid=324, Invalid=2327, Unknown=5, NotChecked=100, Total=2756 [2021-05-02 11:51:18,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2021-05-02 11:51:18,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2021-05-02 11:51:18,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 34 states have internal predecessors, (36), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:51:18,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 42 transitions. [2021-05-02 11:51:18,450 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 42 transitions. Word has length 36 [2021-05-02 11:51:18,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:18,451 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 42 transitions. [2021-05-02 11:51:18,451 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 32 states, 30 states have (on average 1.8666666666666667) internal successors, (56), 29 states have internal predecessors, (56), 5 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2021-05-02 11:51:18,451 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 42 transitions. [2021-05-02 11:51:18,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 11:51:18,451 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:18,451 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:18,652 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2021-05-02 11:51:18,652 INFO L428 AbstractCegarLoop]: === Iteration 14 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:18,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:18,653 INFO L82 PathProgramCache]: Analyzing trace with hash -423634823, now seen corresponding path program 3 times [2021-05-02 11:51:18,653 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:18,653 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647997901] [2021-05-02 11:51:18,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:18,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:18,693 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:18,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:18,697 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:51:18,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:18,774 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:51:18,774 INFO L179 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-05-02 11:51:18,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1647997901] [2021-05-02 11:51:18,774 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1647997901] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:18,774 INFO L361 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333087163] [2021-05-02 11:51:18,774 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-05-02 11:51:18,967 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2021-05-02 11:51:18,967 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-05-02 11:51:18,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 14 conjunts are in the unsatisfiable core [2021-05-02 11:51:18,969 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-05-02 11:51:19,034 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:19,036 WARN L159 QuantifierPusher]: Ignoring assumption. [2021-05-02 11:51:19,051 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 15 proven. 40 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-05-02 11:51:19,051 INFO L200 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333087163] provided 0 perfect and 1 imperfect interpolant sequences [2021-05-02 11:51:19,051 INFO L226 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2021-05-02 11:51:19,051 INFO L239 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 10 [2021-05-02 11:51:19,051 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623783618] [2021-05-02 11:51:19,051 INFO L460 AbstractCegarLoop]: Interpolant automaton has 10 states [2021-05-02 11:51:19,051 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-05-02 11:51:19,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-05-02 11:51:19,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-05-02 11:51:19,052 INFO L87 Difference]: Start difference. First operand 41 states and 42 transitions. Second operand has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:51:19,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-05-02 11:51:19,401 INFO L93 Difference]: Finished difference Result 64 states and 68 transitions. [2021-05-02 11:51:19,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-05-02 11:51:19,402 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 40 [2021-05-02 11:51:19,402 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-05-02 11:51:19,402 INFO L225 Difference]: With dead ends: 64 [2021-05-02 11:51:19,402 INFO L226 Difference]: Without dead ends: 50 [2021-05-02 11:51:19,403 INFO L779 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 260.7ms TimeCoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2021-05-02 11:51:19,403 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2021-05-02 11:51:19,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 43. [2021-05-02 11:51:19,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 36 states have internal predecessors, (38), 4 states have call successors, (4), 4 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2021-05-02 11:51:19,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 44 transitions. [2021-05-02 11:51:19,410 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 44 transitions. Word has length 40 [2021-05-02 11:51:19,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-05-02 11:51:19,410 INFO L480 AbstractCegarLoop]: Abstraction has 43 states and 44 transitions. [2021-05-02 11:51:19,410 INFO L481 AbstractCegarLoop]: Interpolant automaton has has 10 states, 10 states have (on average 3.7) internal successors, (37), 9 states have internal predecessors, (37), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2021-05-02 11:51:19,410 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 44 transitions. [2021-05-02 11:51:19,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2021-05-02 11:51:19,410 INFO L515 BasicCegarLoop]: Found error trace [2021-05-02 11:51:19,411 INFO L523 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-05-02 11:51:19,613 WARN L517 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2021-05-02 11:51:19,614 INFO L428 AbstractCegarLoop]: === Iteration 15 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-05-02 11:51:19,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-05-02 11:51:19,614 INFO L82 PathProgramCache]: Analyzing trace with hash -165469385, now seen corresponding path program 5 times [2021-05-02 11:51:19,614 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-05-02 11:51:19,614 INFO L361 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796395298] [2021-05-02 11:51:19,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-05-02 11:51:19,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:19,752 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2021-05-02 11:51:19,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-05-02 11:51:19,768 INFO L375 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2021-05-02 11:51:19,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat