/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench/geo2.c -------------------------------------------------------------------------------- This is Ultimate 0.1.25-267fbe0 [2020-07-17 22:52:42,874 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-17 22:52:42,876 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-17 22:52:42,889 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-17 22:52:42,889 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-17 22:52:42,890 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-17 22:52:42,891 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-17 22:52:42,893 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-17 22:52:42,895 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-17 22:52:42,896 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-17 22:52:42,897 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-17 22:52:42,898 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-17 22:52:42,899 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-17 22:52:42,900 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-17 22:52:42,901 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-17 22:52:42,902 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-17 22:52:42,904 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-17 22:52:42,905 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-17 22:52:42,908 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-17 22:52:42,910 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-17 22:52:42,917 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-17 22:52:42,918 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-17 22:52:42,921 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-17 22:52:42,922 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-17 22:52:42,924 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-17 22:52:42,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-17 22:52:42,925 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-17 22:52:42,927 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-17 22:52:42,927 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-17 22:52:42,928 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-17 22:52:42,929 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-17 22:52:42,930 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-17 22:52:42,931 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-17 22:52:42,932 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-17 22:52:42,935 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-17 22:52:42,935 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-17 22:52:42,937 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-17 22:52:42,937 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-17 22:52:42,937 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-17 22:52:42,938 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-17 22:52:42,940 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-17 22:52:42,941 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 [2020-07-17 22:52:42,966 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-17 22:52:42,966 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-17 22:52:42,969 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-17 22:52:42,969 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-17 22:52:42,970 INFO L138 SettingsManager]: * Use SBE=true [2020-07-17 22:52:42,970 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-17 22:52:42,970 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-17 22:52:42,970 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-17 22:52:42,970 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-17 22:52:42,971 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-17 22:52:42,972 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-17 22:52:42,972 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-17 22:52:42,972 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-17 22:52:42,973 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-17 22:52:42,973 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-17 22:52:42,973 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-17 22:52:42,973 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-17 22:52:42,973 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-17 22:52:42,974 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-17 22:52:42,975 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-17 22:52:42,975 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-17 22:52:42,977 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-17 22:52:42,977 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-17 22:52:42,977 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-17 22:52:42,977 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-17 22:52:42,977 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-17 22:52:42,978 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-17 22:52:42,978 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-17 22:52:42,978 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-17 22:52:42,978 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2020-07-17 22:52:43,274 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-17 22:52:43,289 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-17 22:52:43,293 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-17 22:52:43,295 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-17 22:52:43,296 INFO L275 PluginConnector]: CDTParser initialized [2020-07-17 22:52:43,296 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-17 22:52:43,380 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ecdcd83c/8270459f4c2d40629d5f446194c912c6/FLAG3a6cc8984 [2020-07-17 22:52:43,917 INFO L306 CDTParser]: Found 1 translation units. [2020-07-17 22:52:43,917 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/geo2.c [2020-07-17 22:52:43,926 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ecdcd83c/8270459f4c2d40629d5f446194c912c6/FLAG3a6cc8984 [2020-07-17 22:52:44,225 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8ecdcd83c/8270459f4c2d40629d5f446194c912c6 [2020-07-17 22:52:44,236 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-17 22:52:44,239 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2020-07-17 22:52:44,241 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:44,241 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-17 22:52:44,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-17 22:52:44,247 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ec926a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44, skipping insertion in model container [2020-07-17 22:52:44,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,260 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-17 22:52:44,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-17 22:52:44,515 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:44,521 INFO L203 MainTranslator]: Completed pre-run [2020-07-17 22:52:44,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-17 22:52:44,558 INFO L208 MainTranslator]: Completed translation [2020-07-17 22:52:44,559 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44 WrapperNode [2020-07-17 22:52:44,559 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-17 22:52:44,560 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-17 22:52:44,560 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-17 22:52:44,561 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-17 22:52:44,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,573 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,578 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,578 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,583 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,589 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (1/1) ... [2020-07-17 22:52:44,593 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-17 22:52:44,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-17 22:52:44,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-17 22:52:44,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-17 22:52:44,595 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (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 [2020-07-17 22:52:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2020-07-17 22:52:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-17 22:52:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2020-07-17 22:52:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2020-07-17 22:52:44,765 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2020-07-17 22:52:44,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2020-07-17 22:52:44,765 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2020-07-17 22:52:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2020-07-17 22:52:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2020-07-17 22:52:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2020-07-17 22:52:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure main [2020-07-17 22:52:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2020-07-17 22:52:44,766 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-17 22:52:45,042 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-17 22:52:45,043 INFO L295 CfgBuilder]: Removed 1 assume(true) statements. [2020-07-17 22:52:45,049 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:45 BoogieIcfgContainer [2020-07-17 22:52:45,050 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-17 22:52:45,052 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-17 22:52:45,052 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-17 22:52:45,057 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-17 22:52:45,058 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.07 10:52:44" (1/3) ... [2020-07-17 22:52:45,059 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34222082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:45, skipping insertion in model container [2020-07-17 22:52:45,060 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.07 10:52:44" (2/3) ... [2020-07-17 22:52:45,060 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34222082 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.07 10:52:45, skipping insertion in model container [2020-07-17 22:52:45,061 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.07 10:52:45" (3/3) ... [2020-07-17 22:52:45,063 INFO L109 eAbstractionObserver]: Analyzing ICFG geo2.c [2020-07-17 22:52:45,080 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-17 22:52:45,089 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-17 22:52:45,104 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-17 22:52:45,151 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-17 22:52:45,152 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-17 22:52:45,152 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-17 22:52:45,152 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-17 22:52:45,160 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-17 22:52:45,160 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-17 22:52:45,161 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-17 22:52:45,161 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-17 22:52:45,178 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states. [2020-07-17 22:52:45,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:45,184 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:45,185 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:45,185 INFO L427 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:45,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:45,191 INFO L82 PathProgramCache]: Analyzing trace with hash -64610451, now seen corresponding path program 1 times [2020-07-17 22:52:45,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:45,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117764617] [2020-07-17 22:52:45,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:45,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,354 INFO L280 TraceCheckUtils]: 0: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:52:45,355 INFO L275 TraceCheckUtils]: 1: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-17 22:52:45,357 INFO L263 TraceCheckUtils]: 0: Hoare triple {23#true} call ULTIMATE.init(); {23#true} is VALID [2020-07-17 22:52:45,357 INFO L280 TraceCheckUtils]: 1: Hoare triple {23#true} assume true; {23#true} is VALID [2020-07-17 22:52:45,358 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {23#true} {23#true} #46#return; {23#true} is VALID [2020-07-17 22:52:45,358 INFO L263 TraceCheckUtils]: 3: Hoare triple {23#true} call #t~ret2 := main(); {23#true} is VALID [2020-07-17 22:52:45,359 INFO L280 TraceCheckUtils]: 4: Hoare triple {23#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {23#true} is VALID [2020-07-17 22:52:45,367 INFO L280 TraceCheckUtils]: 5: Hoare triple {23#true} assume false; {24#false} is VALID [2020-07-17 22:52:45,367 INFO L263 TraceCheckUtils]: 6: Hoare triple {24#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {24#false} is VALID [2020-07-17 22:52:45,368 INFO L280 TraceCheckUtils]: 7: Hoare triple {24#false} ~cond := #in~cond; {24#false} is VALID [2020-07-17 22:52:45,368 INFO L280 TraceCheckUtils]: 8: Hoare triple {24#false} assume 0 == ~cond; {24#false} is VALID [2020-07-17 22:52:45,368 INFO L280 TraceCheckUtils]: 9: Hoare triple {24#false} assume !false; {24#false} is VALID [2020-07-17 22:52:45,370 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:45,371 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117764617] [2020-07-17 22:52:45,374 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:45,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-17 22:52:45,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038794056] [2020-07-17 22:52:45,396 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:52:45,401 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:45,409 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-17 22:52:45,483 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:45,483 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-17 22:52:45,484 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:45,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-17 22:52:45,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:45,500 INFO L87 Difference]: Start difference. First operand 20 states. Second operand 2 states. [2020-07-17 22:52:45,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:45,624 INFO L93 Difference]: Finished difference Result 35 states and 45 transitions. [2020-07-17 22:52:45,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-17 22:52:45,626 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 10 [2020-07-17 22:52:45,627 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:45,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:45,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-17 22:52:45,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-17 22:52:45,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 45 transitions. [2020-07-17 22:52:45,661 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 45 transitions. [2020-07-17 22:52:45,813 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:45,829 INFO L225 Difference]: With dead ends: 35 [2020-07-17 22:52:45,829 INFO L226 Difference]: Without dead ends: 15 [2020-07-17 22:52:45,835 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-17 22:52:45,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2020-07-17 22:52:45,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2020-07-17 22:52:45,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:45,874 INFO L82 GeneralOperation]: Start isEquivalent. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,875 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,875 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:45,880 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-17 22:52:45,880 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:45,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:45,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:45,882 INFO L74 IsIncluded]: Start isIncluded. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,882 INFO L87 Difference]: Start difference. First operand 15 states. Second operand 15 states. [2020-07-17 22:52:45,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:45,885 INFO L93 Difference]: Finished difference Result 15 states and 16 transitions. [2020-07-17 22:52:45,886 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:45,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:45,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:45,887 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:45,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:45,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2020-07-17 22:52:45,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2020-07-17 22:52:45,891 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2020-07-17 22:52:45,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:45,892 INFO L479 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2020-07-17 22:52:45,892 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-17 22:52:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2020-07-17 22:52:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2020-07-17 22:52:45,893 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:45,893 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:45,894 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-17 22:52:45,894 INFO L427 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:45,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:45,895 INFO L82 PathProgramCache]: Analyzing trace with hash -62822991, now seen corresponding path program 1 times [2020-07-17 22:52:45,895 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:45,896 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239547309] [2020-07-17 22:52:45,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:45,908 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:45,908 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1073088490] [2020-07-17 22:52:45,909 INFO L94 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 [2020-07-17 22:52:45,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,959 INFO L264 TraceCheckSpWp]: Trace formula consists of 34 conjuncts, 7 conjunts are in the unsatisfiable core [2020-07-17 22:52:45,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:45,975 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:46,140 INFO L263 TraceCheckUtils]: 0: Hoare triple {129#true} call ULTIMATE.init(); {129#true} is VALID [2020-07-17 22:52:46,141 INFO L280 TraceCheckUtils]: 1: Hoare triple {129#true} assume true; {129#true} is VALID [2020-07-17 22:52:46,142 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {129#true} {129#true} #46#return; {129#true} is VALID [2020-07-17 22:52:46,142 INFO L263 TraceCheckUtils]: 3: Hoare triple {129#true} call #t~ret2 := main(); {129#true} is VALID [2020-07-17 22:52:46,146 INFO L280 TraceCheckUtils]: 4: Hoare triple {129#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:52:46,149 INFO L280 TraceCheckUtils]: 5: Hoare triple {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:52:46,153 INFO L263 TraceCheckUtils]: 6: Hoare triple {146#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {153#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:46,155 INFO L280 TraceCheckUtils]: 7: Hoare triple {153#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {157#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:46,156 INFO L280 TraceCheckUtils]: 8: Hoare triple {157#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {130#false} is VALID [2020-07-17 22:52:46,157 INFO L280 TraceCheckUtils]: 9: Hoare triple {130#false} assume !false; {130#false} is VALID [2020-07-17 22:52:46,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:46,160 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239547309] [2020-07-17 22:52:46,161 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:46,163 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1073088490] [2020-07-17 22:52:46,164 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-17 22:52:46,164 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-17 22:52:46,165 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [332416948] [2020-07-17 22:52:46,167 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:46,168 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:46,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-17 22:52:46,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:46,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-17 22:52:46,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:46,192 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-17 22:52:46,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-17 22:52:46,193 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand 5 states. [2020-07-17 22:52:46,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,404 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2020-07-17 22:52:46,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-17 22:52:46,405 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 10 [2020-07-17 22:52:46,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:46,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:46,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-17 22:52:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-17 22:52:46,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 27 transitions. [2020-07-17 22:52:46,415 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 27 transitions. [2020-07-17 22:52:46,468 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:46,470 INFO L225 Difference]: With dead ends: 25 [2020-07-17 22:52:46,472 INFO L226 Difference]: Without dead ends: 22 [2020-07-17 22:52:46,474 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:52:46,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2020-07-17 22:52:46,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2020-07-17 22:52:46,496 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:46,496 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,496 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,496 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,500 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:52:46,500 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:46,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,501 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,502 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 22 states. [2020-07-17 22:52:46,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:46,505 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2020-07-17 22:52:46,505 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:46,506 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:46,506 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:46,506 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:46,507 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:46,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2020-07-17 22:52:46,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 23 transitions. [2020-07-17 22:52:46,510 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 23 transitions. Word has length 10 [2020-07-17 22:52:46,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:46,510 INFO L479 AbstractCegarLoop]: Abstraction has 22 states and 23 transitions. [2020-07-17 22:52:46,510 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-17 22:52:46,510 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 23 transitions. [2020-07-17 22:52:46,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2020-07-17 22:52:46,511 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:46,512 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:46,727 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2020-07-17 22:52:46,727 INFO L427 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:46,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:46,728 INFO L82 PathProgramCache]: Analyzing trace with hash 50868238, now seen corresponding path program 1 times [2020-07-17 22:52:46,728 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:46,729 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1472859633] [2020-07-17 22:52:46,729 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:46,737 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:46,737 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [806011444] [2020-07-17 22:52:46,737 INFO L94 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) [2020-07-17 22:52:46,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:46,771 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 13 conjunts are in the unsatisfiable core [2020-07-17 22:52:46,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:46,786 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:52:46,966 INFO L263 TraceCheckUtils]: 0: Hoare triple {279#true} call ULTIMATE.init(); {279#true} is VALID [2020-07-17 22:52:46,966 INFO L280 TraceCheckUtils]: 1: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:52:46,967 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {279#true} {279#true} #46#return; {279#true} is VALID [2020-07-17 22:52:46,967 INFO L263 TraceCheckUtils]: 3: Hoare triple {279#true} call #t~ret2 := main(); {279#true} is VALID [2020-07-17 22:52:46,968 INFO L280 TraceCheckUtils]: 4: Hoare triple {279#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:52:46,969 INFO L280 TraceCheckUtils]: 5: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:52:46,970 INFO L263 TraceCheckUtils]: 6: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {279#true} is VALID [2020-07-17 22:52:46,970 INFO L280 TraceCheckUtils]: 7: Hoare triple {279#true} ~cond := #in~cond; {279#true} is VALID [2020-07-17 22:52:46,970 INFO L280 TraceCheckUtils]: 8: Hoare triple {279#true} assume !(0 == ~cond); {279#true} is VALID [2020-07-17 22:52:46,971 INFO L280 TraceCheckUtils]: 9: Hoare triple {279#true} assume true; {279#true} is VALID [2020-07-17 22:52:46,972 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {279#true} {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} #50#return; {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:52:46,974 INFO L280 TraceCheckUtils]: 11: Hoare triple {296#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:52:46,975 INFO L280 TraceCheckUtils]: 12: Hoare triple {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} assume !false; {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:52:46,980 INFO L263 TraceCheckUtils]: 13: Hoare triple {318#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {325#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:52:46,981 INFO L280 TraceCheckUtils]: 14: Hoare triple {325#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {329#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:52:46,982 INFO L280 TraceCheckUtils]: 15: Hoare triple {329#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {280#false} is VALID [2020-07-17 22:52:46,982 INFO L280 TraceCheckUtils]: 16: Hoare triple {280#false} assume !false; {280#false} is VALID [2020-07-17 22:52:46,984 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-17 22:52:46,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1472859633] [2020-07-17 22:52:46,985 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:52:46,985 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [806011444] [2020-07-17 22:52:46,985 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:52:46,986 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2020-07-17 22:52:46,986 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813346302] [2020-07-17 22:52:46,986 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:52:46,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:52:46,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states. [2020-07-17 22:52:47,035 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:47,036 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-07-17 22:52:47,037 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:52:47,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-07-17 22:52:47,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2020-07-17 22:52:47,038 INFO L87 Difference]: Start difference. First operand 22 states and 23 transitions. Second operand 6 states. [2020-07-17 22:52:57,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:57,513 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2020-07-17 22:52:57,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-17 22:52:57,514 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2020-07-17 22:52:57,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:52:57,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:57,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-17 22:52:57,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2020-07-17 22:52:57,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2020-07-17 22:52:57,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 31 transitions. [2020-07-17 22:52:59,634 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:52:59,636 INFO L225 Difference]: With dead ends: 32 [2020-07-17 22:52:59,637 INFO L226 Difference]: Without dead ends: 30 [2020-07-17 22:52:59,637 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:52:59,638 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2020-07-17 22:52:59,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2020-07-17 22:52:59,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:52:59,663 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand 28 states. [2020-07-17 22:52:59,663 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand 28 states. [2020-07-17 22:52:59,663 INFO L87 Difference]: Start difference. First operand 30 states. Second operand 28 states. [2020-07-17 22:52:59,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:59,667 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-17 22:52:59,667 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-17 22:52:59,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:59,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:59,668 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 30 states. [2020-07-17 22:52:59,668 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 30 states. [2020-07-17 22:52:59,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:52:59,672 INFO L93 Difference]: Finished difference Result 30 states and 32 transitions. [2020-07-17 22:52:59,672 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 32 transitions. [2020-07-17 22:52:59,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:52:59,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:52:59,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:52:59,674 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:52:59,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-17 22:52:59,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 29 transitions. [2020-07-17 22:52:59,676 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 29 transitions. Word has length 17 [2020-07-17 22:52:59,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:52:59,677 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 29 transitions. [2020-07-17 22:52:59,677 INFO L480 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-07-17 22:52:59,677 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 29 transitions. [2020-07-17 22:52:59,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-17 22:52:59,678 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:52:59,678 INFO L422 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:52:59,879 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:52:59,879 INFO L427 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:52:59,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:52:59,880 INFO L82 PathProgramCache]: Analyzing trace with hash 325764102, now seen corresponding path program 1 times [2020-07-17 22:52:59,881 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:52:59,881 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770702507] [2020-07-17 22:52:59,881 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:52:59,888 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:52:59,889 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [885766336] [2020-07-17 22:52:59,889 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY 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 [2020-07-17 22:52:59,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:59,916 INFO L264 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 11 conjunts are in the unsatisfiable core [2020-07-17 22:52:59,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-17 22:52:59,930 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:00,035 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:53:00,131 INFO L263 TraceCheckUtils]: 0: Hoare triple {486#true} call ULTIMATE.init(); {486#true} is VALID [2020-07-17 22:53:00,132 INFO L280 TraceCheckUtils]: 1: Hoare triple {486#true} assume true; {486#true} is VALID [2020-07-17 22:53:00,132 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {486#true} {486#true} #46#return; {486#true} is VALID [2020-07-17 22:53:00,133 INFO L263 TraceCheckUtils]: 3: Hoare triple {486#true} call #t~ret2 := main(); {486#true} is VALID [2020-07-17 22:53:00,133 INFO L280 TraceCheckUtils]: 4: Hoare triple {486#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {486#true} is VALID [2020-07-17 22:53:00,133 INFO L280 TraceCheckUtils]: 5: Hoare triple {486#true} assume !false; {486#true} is VALID [2020-07-17 22:53:00,134 INFO L263 TraceCheckUtils]: 6: Hoare triple {486#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {486#true} is VALID [2020-07-17 22:53:00,134 INFO L280 TraceCheckUtils]: 7: Hoare triple {486#true} ~cond := #in~cond; {486#true} is VALID [2020-07-17 22:53:00,134 INFO L280 TraceCheckUtils]: 8: Hoare triple {486#true} assume !(0 == ~cond); {486#true} is VALID [2020-07-17 22:53:00,135 INFO L280 TraceCheckUtils]: 9: Hoare triple {486#true} assume true; {486#true} is VALID [2020-07-17 22:53:00,135 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {486#true} {486#true} #50#return; {486#true} is VALID [2020-07-17 22:53:00,136 INFO L280 TraceCheckUtils]: 11: Hoare triple {486#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {486#true} is VALID [2020-07-17 22:53:00,136 INFO L280 TraceCheckUtils]: 12: Hoare triple {486#true} assume !false; {486#true} is VALID [2020-07-17 22:53:00,136 INFO L263 TraceCheckUtils]: 13: Hoare triple {486#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {486#true} is VALID [2020-07-17 22:53:00,137 INFO L280 TraceCheckUtils]: 14: Hoare triple {486#true} ~cond := #in~cond; {533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:00,138 INFO L280 TraceCheckUtils]: 15: Hoare triple {533#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:00,139 INFO L280 TraceCheckUtils]: 16: Hoare triple {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:00,142 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {537#(not (= 0 |__VERIFIER_assert_#in~cond|))} {486#true} #50#return; {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-17 22:53:00,143 INFO L280 TraceCheckUtils]: 18: Hoare triple {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} assume !(~c~0 < ~k~0); {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-17 22:53:00,145 INFO L263 TraceCheckUtils]: 19: Hoare triple {544#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {551#(= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2020-07-17 22:53:00,146 INFO L280 TraceCheckUtils]: 20: Hoare triple {551#(= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {555#(= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:00,147 INFO L280 TraceCheckUtils]: 21: Hoare triple {555#(= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {487#false} is VALID [2020-07-17 22:53:00,148 INFO L280 TraceCheckUtils]: 22: Hoare triple {487#false} assume !false; {487#false} is VALID [2020-07-17 22:53:00,149 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-07-17 22:53:00,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770702507] [2020-07-17 22:53:00,150 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:00,150 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885766336] [2020-07-17 22:53:00,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:53:00,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2020-07-17 22:53:00,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907107201] [2020-07-17 22:53:00,152 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:53:00,152 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:00,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-17 22:53:00,191 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:00,192 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-17 22:53:00,192 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:00,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-17 22:53:00,193 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2020-07-17 22:53:00,193 INFO L87 Difference]: Start difference. First operand 28 states and 29 transitions. Second operand 7 states. [2020-07-17 22:53:05,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:05,060 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-17 22:53:05,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-17 22:53:05,060 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-17 22:53:05,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:53:05,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:53:05,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-17 22:53:05,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-17 22:53:05,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 24 transitions. [2020-07-17 22:53:05,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 24 transitions. [2020-07-17 22:53:05,141 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:05,143 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:53:05,143 INFO L226 Difference]: Without dead ends: 27 [2020-07-17 22:53:05,144 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2020-07-17 22:53:05,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-17 22:53:05,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2020-07-17 22:53:05,188 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:53:05,189 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:05,189 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:05,189 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:05,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:05,197 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-17 22:53:05,197 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:53:05,198 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:05,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:05,201 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:05,201 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 27 states. [2020-07-17 22:53:05,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:53:05,205 INFO L93 Difference]: Finished difference Result 27 states and 27 transitions. [2020-07-17 22:53:05,205 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:53:05,211 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:53:05,211 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:53:05,212 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:53:05,212 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:53:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2020-07-17 22:53:05,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2020-07-17 22:53:05,223 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 23 [2020-07-17 22:53:05,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:53:05,224 INFO L479 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2020-07-17 22:53:05,224 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-17 22:53:05,224 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2020-07-17 22:53:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2020-07-17 22:53:05,231 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:53:05,231 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:53:05,431 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:53:05,432 INFO L427 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:53:05,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:53:05,433 INFO L82 PathProgramCache]: Analyzing trace with hash 1538749201, now seen corresponding path program 2 times [2020-07-17 22:53:05,433 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:53:05,434 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1920511371] [2020-07-17 22:53:05,434 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:53:05,448 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:53:05,449 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1640458472] [2020-07-17 22:53:05,450 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 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 [2020-07-17 22:53:05,519 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2020-07-17 22:53:05,520 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:53:05,521 INFO L264 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 22 conjunts are in the unsatisfiable core [2020-07-17 22:53:07,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-17 22:53:07,557 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:53:11,975 WARN L193 SmtUtils]: Spent 2.26 s on a formula simplification that was a NOOP. DAG size: 13 [2020-07-17 22:53:12,111 INFO L263 TraceCheckUtils]: 0: Hoare triple {708#true} call ULTIMATE.init(); {708#true} is VALID [2020-07-17 22:53:12,112 INFO L280 TraceCheckUtils]: 1: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-17 22:53:12,112 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {708#true} {708#true} #46#return; {708#true} is VALID [2020-07-17 22:53:12,113 INFO L263 TraceCheckUtils]: 3: Hoare triple {708#true} call #t~ret2 := main(); {708#true} is VALID [2020-07-17 22:53:12,115 INFO L280 TraceCheckUtils]: 4: Hoare triple {708#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:53:12,117 INFO L280 TraceCheckUtils]: 5: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !false; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:53:12,117 INFO L263 TraceCheckUtils]: 6: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {708#true} is VALID [2020-07-17 22:53:12,117 INFO L280 TraceCheckUtils]: 7: Hoare triple {708#true} ~cond := #in~cond; {708#true} is VALID [2020-07-17 22:53:12,118 INFO L280 TraceCheckUtils]: 8: Hoare triple {708#true} assume !(0 == ~cond); {708#true} is VALID [2020-07-17 22:53:12,118 INFO L280 TraceCheckUtils]: 9: Hoare triple {708#true} assume true; {708#true} is VALID [2020-07-17 22:53:12,119 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {708#true} {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} #50#return; {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} is VALID [2020-07-17 22:53:12,123 INFO L280 TraceCheckUtils]: 11: Hoare triple {725#(and (= 1 main_~x~0) (= 1 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:53:12,124 INFO L280 TraceCheckUtils]: 12: Hoare triple {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} assume !false; {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:53:12,125 INFO L263 TraceCheckUtils]: 13: Hoare triple {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {708#true} is VALID [2020-07-17 22:53:12,126 INFO L280 TraceCheckUtils]: 14: Hoare triple {708#true} ~cond := #in~cond; {757#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:12,126 INFO L280 TraceCheckUtils]: 15: Hoare triple {757#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:12,127 INFO L280 TraceCheckUtils]: 16: Hoare triple {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:53:12,128 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {761#(not (= 0 |__VERIFIER_assert_#in~cond|))} {747#(and (= main_~x~0 (+ main_~z~0 1)) (= main_~z~0 main_~y~0))} #50#return; {768#(and (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0)) (= main_~z~0 main_~y~0))} is VALID [2020-07-17 22:53:12,134 INFO L280 TraceCheckUtils]: 18: Hoare triple {768#(and (= main_~x~0 (+ main_~z~0 1)) (= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0)) (= main_~z~0 main_~y~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-17 22:53:12,135 INFO L280 TraceCheckUtils]: 19: Hoare triple {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} assume !false; {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} is VALID [2020-07-17 22:53:14,167 INFO L263 TraceCheckUtils]: 20: Hoare triple {772#(and (= (+ main_~z~0 (* main_~z~0 main_~z~0) 1) main_~x~0) (= main_~y~0 (* main_~z~0 main_~z~0)))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {779#(<= 1 |__VERIFIER_assert_#in~cond|)} is UNKNOWN [2020-07-17 22:53:14,169 INFO L280 TraceCheckUtils]: 21: Hoare triple {779#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {783#(<= 1 __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:53:14,170 INFO L280 TraceCheckUtils]: 22: Hoare triple {783#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {709#false} is VALID [2020-07-17 22:53:14,170 INFO L280 TraceCheckUtils]: 23: Hoare triple {709#false} assume !false; {709#false} is VALID [2020-07-17 22:53:14,171 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2020-07-17 22:53:14,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1920511371] [2020-07-17 22:53:14,172 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:53:14,172 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1640458472] [2020-07-17 22:53:14,172 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:53:14,173 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2020-07-17 22:53:14,173 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644682069] [2020-07-17 22:53:14,173 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:53:14,174 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:53:14,174 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states. [2020-07-17 22:53:16,267 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:53:16,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2020-07-17 22:53:16,268 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:53:16,269 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2020-07-17 22:53:16,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=70, Unknown=1, NotChecked=0, Total=90 [2020-07-17 22:53:16,270 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 10 states. [2020-07-17 22:54:14,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:54:14,062 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2020-07-17 22:54:14,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:54:14,062 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 24 [2020-07-17 22:54:14,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:54:14,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:54:14,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-17 22:54:14,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2020-07-17 22:54:14,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 31 transitions. [2020-07-17 22:54:14,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 31 transitions. [2020-07-17 22:54:16,265 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 30 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2020-07-17 22:54:16,268 INFO L225 Difference]: With dead ends: 37 [2020-07-17 22:54:16,268 INFO L226 Difference]: Without dead ends: 35 [2020-07-17 22:54:16,269 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=30, Invalid=101, Unknown=1, NotChecked=0, Total=132 [2020-07-17 22:54:16,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2020-07-17 22:54:16,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2020-07-17 22:54:16,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:54:16,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand 34 states. [2020-07-17 22:54:16,305 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand 34 states. [2020-07-17 22:54:16,305 INFO L87 Difference]: Start difference. First operand 35 states. Second operand 34 states. [2020-07-17 22:54:16,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:54:16,308 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-17 22:54:16,308 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-17 22:54:16,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:54:16,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:54:16,309 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand 35 states. [2020-07-17 22:54:16,309 INFO L87 Difference]: Start difference. First operand 34 states. Second operand 35 states. [2020-07-17 22:54:16,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:54:16,312 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2020-07-17 22:54:16,312 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 35 transitions. [2020-07-17 22:54:16,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:54:16,312 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:54:16,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:54:16,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:54:16,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2020-07-17 22:54:16,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2020-07-17 22:54:16,315 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 24 [2020-07-17 22:54:16,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:54:16,316 INFO L479 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2020-07-17 22:54:16,316 INFO L480 AbstractCegarLoop]: Interpolant automaton has 10 states. [2020-07-17 22:54:16,316 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2020-07-17 22:54:16,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2020-07-17 22:54:16,317 INFO L414 BasicCegarLoop]: Found error trace [2020-07-17 22:54:16,317 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1] [2020-07-17 22:54:16,530 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-17 22:54:16,531 INFO L427 AbstractCegarLoop]: === Iteration 6 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-17 22:54:16,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-17 22:54:16,532 INFO L82 PathProgramCache]: Analyzing trace with hash -695576914, now seen corresponding path program 3 times [2020-07-17 22:54:16,532 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-17 22:54:16,533 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1722595375] [2020-07-17 22:54:16,533 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-17 22:54:16,539 ERROR L271 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2020-07-17 22:54:16,540 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [246614119] [2020-07-17 22:54:16,540 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 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 [2020-07-17 22:54:16,585 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2020-07-17 22:54:16,586 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2020-07-17 22:54:16,587 INFO L264 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 14 conjunts are in the unsatisfiable core [2020-07-17 22:54:18,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2020-07-17 22:54:18,672 INFO L287 TraceCheckSpWp]: Computing forward predicates... [2020-07-17 22:54:22,377 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:54:31,291 WARN L838 $PredicateComparison]: unable to prove that (or (and (<= 0 |c___VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1)))))) (<= 1 |c___VERIFIER_assert_#in~cond|)) is different from false [2020-07-17 22:54:31,307 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:54:54,781 WARN L193 SmtUtils]: Spent 11.79 s on a formula simplification that was a NOOP. DAG size: 23 [2020-07-17 22:54:56,885 INFO L501 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2020-07-17 22:55:05,171 WARN L838 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))) is different from false [2020-07-17 22:55:07,200 WARN L860 $PredicateComparison]: unable to prove that (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))) is different from true [2020-07-17 22:55:07,201 INFO L263 TraceCheckUtils]: 0: Hoare triple {966#true} call ULTIMATE.init(); {966#true} is VALID [2020-07-17 22:55:07,201 INFO L280 TraceCheckUtils]: 1: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:55:07,202 INFO L275 TraceCheckUtils]: 2: Hoare quadruple {966#true} {966#true} #46#return; {966#true} is VALID [2020-07-17 22:55:07,202 INFO L263 TraceCheckUtils]: 3: Hoare triple {966#true} call #t~ret2 := main(); {966#true} is VALID [2020-07-17 22:55:07,202 INFO L280 TraceCheckUtils]: 4: Hoare triple {966#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;assume -2147483648 <= #t~nondet0 && #t~nondet0 <= 2147483647;~z~0 := #t~nondet0;havoc #t~nondet0;assume -2147483648 <= #t~nondet1 && #t~nondet1 <= 2147483647;~k~0 := #t~nondet1;havoc #t~nondet1;~x~0 := 1;~y~0 := 1;~c~0 := 1; {966#true} is VALID [2020-07-17 22:55:07,202 INFO L280 TraceCheckUtils]: 5: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-17 22:55:07,203 INFO L263 TraceCheckUtils]: 6: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-17 22:55:07,203 INFO L280 TraceCheckUtils]: 7: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2020-07-17 22:55:07,203 INFO L280 TraceCheckUtils]: 8: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2020-07-17 22:55:07,204 INFO L280 TraceCheckUtils]: 9: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:55:07,204 INFO L275 TraceCheckUtils]: 10: Hoare quadruple {966#true} {966#true} #50#return; {966#true} is VALID [2020-07-17 22:55:07,205 INFO L280 TraceCheckUtils]: 11: Hoare triple {966#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {966#true} is VALID [2020-07-17 22:55:07,205 INFO L280 TraceCheckUtils]: 12: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-17 22:55:07,205 INFO L263 TraceCheckUtils]: 13: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-17 22:55:07,205 INFO L280 TraceCheckUtils]: 14: Hoare triple {966#true} ~cond := #in~cond; {966#true} is VALID [2020-07-17 22:55:07,206 INFO L280 TraceCheckUtils]: 15: Hoare triple {966#true} assume !(0 == ~cond); {966#true} is VALID [2020-07-17 22:55:07,206 INFO L280 TraceCheckUtils]: 16: Hoare triple {966#true} assume true; {966#true} is VALID [2020-07-17 22:55:07,206 INFO L275 TraceCheckUtils]: 17: Hoare quadruple {966#true} {966#true} #50#return; {966#true} is VALID [2020-07-17 22:55:07,207 INFO L280 TraceCheckUtils]: 18: Hoare triple {966#true} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {966#true} is VALID [2020-07-17 22:55:07,207 INFO L280 TraceCheckUtils]: 19: Hoare triple {966#true} assume !false; {966#true} is VALID [2020-07-17 22:55:07,207 INFO L263 TraceCheckUtils]: 20: Hoare triple {966#true} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {966#true} is VALID [2020-07-17 22:55:07,209 INFO L280 TraceCheckUtils]: 21: Hoare triple {966#true} ~cond := #in~cond; {1034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2020-07-17 22:55:07,210 INFO L280 TraceCheckUtils]: 22: Hoare triple {1034#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:55:07,210 INFO L280 TraceCheckUtils]: 23: Hoare triple {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} assume true; {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} is VALID [2020-07-17 22:55:07,211 INFO L275 TraceCheckUtils]: 24: Hoare quadruple {1038#(not (= 0 |__VERIFIER_assert_#in~cond|))} {966#true} #50#return; {1045#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} is VALID [2020-07-17 22:55:08,219 INFO L280 TraceCheckUtils]: 25: Hoare triple {1045#(= (+ (* main_~x~0 main_~z~0) 1) (+ (* main_~y~0 main_~z~0) main_~x~0))} assume !!(~c~0 < ~k~0);~c~0 := 1 + ~c~0;~x~0 := 1 + ~x~0 * ~z~0;~y~0 := ~y~0 * ~z~0; {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} is VALID [2020-07-17 22:55:08,221 INFO L280 TraceCheckUtils]: 26: Hoare triple {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} assume !false; {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} is VALID [2020-07-17 22:55:10,303 INFO L263 TraceCheckUtils]: 27: Hoare triple {1049#(exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (and (= main_~y~0 (* main_~z~0 v_main_~y~0_13)) (= main_~x~0 (+ (* main_~z~0 v_main_~x~0_13) 1)) (= (+ (* main_~z~0 v_main_~x~0_13) 1) (+ (* main_~z~0 v_main_~y~0_13) v_main_~x~0_13))))} call __VERIFIER_assert((if 0 == 1 + ~x~0 * ~z~0 - ~x~0 - ~z~0 * ~y~0 then 1 else 0)); {1056#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))) (<= 1 |__VERIFIER_assert_#in~cond|))} is UNKNOWN [2020-07-17 22:55:10,305 INFO L280 TraceCheckUtils]: 28: Hoare triple {1056#(or (and (<= 0 |__VERIFIER_assert_#in~cond|) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))) (<= 1 |__VERIFIER_assert_#in~cond|))} ~cond := #in~cond; {1060#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))))} is VALID [2020-07-17 22:55:10,306 INFO L280 TraceCheckUtils]: 29: Hoare triple {1060#(or (<= 1 __VERIFIER_assert_~cond) (and (<= 0 __VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))))} assume 0 == ~cond; {1064#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))} is VALID [2020-07-17 22:55:12,383 INFO L280 TraceCheckUtils]: 30: Hoare triple {1064#(exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13) 1))))} assume !false; {967#false} is UNKNOWN [2020-07-17 22:55:12,386 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 19 proven. 1 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2020-07-17 22:55:12,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1722595375] [2020-07-17 22:55:12,387 WARN L333 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2020-07-17 22:55:12,387 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [246614119] [2020-07-17 22:55:12,388 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2020-07-17 22:55:12,388 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2020-07-17 22:55:12,388 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1262462936] [2020-07-17 22:55:12,390 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-17 22:55:12,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-17 22:55:12,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states. [2020-07-17 22:55:18,738 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 19 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2020-07-17 22:55:18,739 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2020-07-17 22:55:18,740 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-17 22:55:18,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2020-07-17 22:55:18,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=31, Unknown=4, NotChecked=22, Total=72 [2020-07-17 22:55:18,741 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 9 states. [2020-07-17 22:56:22,987 WARN L838 $PredicateComparison]: unable to prove that (and (or (<= 1 c___VERIFIER_assert_~cond) (and (<= 0 c___VERIFIER_assert_~cond) (exists ((v_main_~y~0_13 Int) (v_main_~z~0_BEFORE_CALL_6 Int) (v_main_~x~0_13 Int)) (let ((.cse0 (* v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13))) (and (not (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6) .cse0) (+ v_main_~z~0_BEFORE_CALL_6 (* v_main_~z~0_BEFORE_CALL_6 v_main_~z~0_BEFORE_CALL_6 v_main_~x~0_13)))) (= (+ (* v_main_~y~0_13 v_main_~z~0_BEFORE_CALL_6) v_main_~x~0_13) (+ .cse0 1))))))) (= |c___VERIFIER_assert_#in~cond| c___VERIFIER_assert_~cond)) is different from false [2020-07-17 22:56:35,815 WARN L193 SmtUtils]: Spent 4.20 s on a formula simplification that was a NOOP. DAG size: 21 [2020-07-17 22:56:51,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:56:51,105 INFO L93 Difference]: Finished difference Result 34 states and 34 transitions. [2020-07-17 22:56:51,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2020-07-17 22:56:51,105 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 31 [2020-07-17 22:56:51,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-17 22:56:51,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:56:51,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2020-07-17 22:56:51,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2020-07-17 22:56:51,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 21 transitions. [2020-07-17 22:56:51,109 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 21 transitions. [2020-07-17 22:57:01,555 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 16 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2020-07-17 22:57:01,556 INFO L225 Difference]: With dead ends: 34 [2020-07-17 22:57:01,556 INFO L226 Difference]: Without dead ends: 0 [2020-07-17 22:57:01,557 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 37.5s TimeCoverageRelationStatistics Valid=25, Invalid=53, Unknown=6, NotChecked=48, Total=132 [2020-07-17 22:57:01,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-17 22:57:01,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-17 22:57:01,559 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-17 22:57:01,559 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:01,559 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:01,559 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:57:01,560 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:57:01,560 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:01,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:01,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:57:01,560 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:01,560 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-17 22:57:01,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-17 22:57:01,561 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-17 22:57:01,561 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:01,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:01,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-17 22:57:01,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-17 22:57:01,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-17 22:57:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-17 22:57:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-17 22:57:01,564 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 31 [2020-07-17 22:57:01,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-17 22:57:01,564 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-17 22:57:01,564 INFO L480 AbstractCegarLoop]: Interpolant automaton has 9 states. [2020-07-17 22:57:01,564 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-17 22:57:01,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-17 22:57:01,766 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2020-07-17 22:57:01,771 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-17 22:57:02,367 WARN L193 SmtUtils]: Spent 484.00 ms on a formula simplification. DAG size of input: 13 DAG size of output: 9 [2020-07-17 22:57:07,466 WARN L193 SmtUtils]: Spent 5.09 s on a formula simplification. DAG size of input: 24 DAG size of output: 19 [2020-07-17 22:57:25,937 WARN L193 SmtUtils]: Spent 16.36 s on a formula simplification. DAG size of input: 30 DAG size of output: 1 [2020-07-17 22:57:40,739 WARN L193 SmtUtils]: Spent 14.80 s on a formula simplification. DAG size of input: 24 DAG size of output: 23 [2020-07-17 22:57:40,745 INFO L271 CegarLoopResult]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2020-07-17 22:57:40,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:57:40,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-17 22:57:40,745 INFO L271 CegarLoopResult]: At program point L-1(line -1) the Hoare annotation is: true [2020-07-17 22:57:40,745 INFO L271 CegarLoopResult]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2020-07-17 22:57:40,745 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-17 22:57:40,745 INFO L268 CegarLoopResult]: For program point assume_abort_if_notENTRY(lines 9 11) no Hoare annotation was computed. [2020-07-17 22:57:40,745 INFO L268 CegarLoopResult]: For program point L10(line 10) no Hoare annotation was computed. [2020-07-17 22:57:40,745 INFO L268 CegarLoopResult]: For program point L10-2(lines 9 11) no Hoare annotation was computed. [2020-07-17 22:57:40,746 INFO L268 CegarLoopResult]: For program point assume_abort_if_notEXIT(lines 9 11) no Hoare annotation was computed. [2020-07-17 22:57:40,746 INFO L264 CegarLoopResult]: At program point L32(line 32) the Hoare annotation is: (or (and (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) (= 1 main_~y~0)) (exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (let ((.cse1 (+ (* main_~z~0 v_main_~x~0_13) 1)) (.cse0 (* main_~z~0 v_main_~y~0_13))) (and (= main_~y~0 .cse0) (= .cse1 main_~x~0) (= .cse1 (+ .cse0 v_main_~x~0_13)))))) [2020-07-17 22:57:40,746 INFO L268 CegarLoopResult]: For program point L32-1(lines 31 40) no Hoare annotation was computed. [2020-07-17 22:57:40,746 INFO L271 CegarLoopResult]: At program point mainENTRY(lines 21 43) the Hoare annotation is: true [2020-07-17 22:57:40,746 INFO L264 CegarLoopResult]: At program point L31-2(lines 31 40) the Hoare annotation is: (or (and (= 1 main_~x~0) (= 1 main_~y~0)) (exists ((v_main_~y~0_13 Int) (v_main_~x~0_13 Int)) (let ((.cse1 (+ (* main_~z~0 v_main_~x~0_13) 1)) (.cse0 (* main_~z~0 v_main_~y~0_13))) (and (= main_~y~0 .cse0) (= .cse1 main_~x~0) (= .cse1 (+ .cse0 v_main_~x~0_13)))))) [2020-07-17 22:57:40,746 INFO L264 CegarLoopResult]: At program point L31-3(lines 31 40) the Hoare annotation is: (= (+ (* main_~x~0 main_~z~0) 1) (+ main_~x~0 (* main_~y~0 main_~z~0))) [2020-07-17 22:57:40,746 INFO L268 CegarLoopResult]: For program point mainEXIT(lines 21 43) no Hoare annotation was computed. [2020-07-17 22:57:40,746 INFO L268 CegarLoopResult]: For program point mainFINAL(lines 21 43) no Hoare annotation was computed. [2020-07-17 22:57:40,746 INFO L268 CegarLoopResult]: For program point L41(line 41) no Hoare annotation was computed. [2020-07-17 22:57:40,746 INFO L271 CegarLoopResult]: At program point __VERIFIER_assertENTRY(lines 12 18) the Hoare annotation is: true [2020-07-17 22:57:40,747 INFO L268 CegarLoopResult]: For program point L14(lines 14 15) no Hoare annotation was computed. [2020-07-17 22:57:40,747 INFO L268 CegarLoopResult]: For program point L13(lines 13 16) no Hoare annotation was computed. [2020-07-17 22:57:40,747 INFO L268 CegarLoopResult]: For program point L13-2(lines 12 18) no Hoare annotation was computed. [2020-07-17 22:57:40,747 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertEXIT(lines 12 18) no Hoare annotation was computed. [2020-07-17 22:57:40,747 INFO L268 CegarLoopResult]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 15) no Hoare annotation was computed. [2020-07-17 22:57:40,751 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:57:40,752 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2020-07-17 22:57:40,753 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:57:40,754 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2020-07-17 22:57:40,754 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:57:40,754 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:57:40,754 WARN L170 areAnnotationChecker]: L10 has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: L10-2 has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:57:40,823 WARN L170 areAnnotationChecker]: L14 has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: L41 has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: L32-1 has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2020-07-17 22:57:40,824 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2020-07-17 22:57:40,824 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-17 22:57:40,830 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,831 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,835 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,836 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,838 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.07 10:57:40 BoogieIcfgContainer [2020-07-17 22:57:40,838 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-17 22:57:40,840 INFO L168 Benchmark]: Toolchain (without parser) took 296602.53 ms. Allocated memory was 144.7 MB in the beginning and 267.4 MB in the end (delta: 122.7 MB). Free memory was 102.5 MB in the beginning and 223.9 MB in the end (delta: -121.4 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2020-07-17 22:57:40,841 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. [2020-07-17 22:57:40,842 INFO L168 Benchmark]: CACSL2BoogieTranslator took 319.26 ms. Allocated memory is still 144.7 MB. Free memory was 102.1 MB in the beginning and 92.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:57:40,842 INFO L168 Benchmark]: Boogie Preprocessor took 32.56 ms. Allocated memory is still 144.7 MB. Free memory was 92.4 MB in the beginning and 90.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2020-07-17 22:57:40,843 INFO L168 Benchmark]: RCFGBuilder took 457.03 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 164.6 MB in the end (delta: -73.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. [2020-07-17 22:57:40,844 INFO L168 Benchmark]: TraceAbstraction took 295786.26 ms. Allocated memory was 201.9 MB in the beginning and 267.4 MB in the end (delta: 65.5 MB). Free memory was 164.6 MB in the beginning and 223.9 MB in the end (delta: -59.4 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. [2020-07-17 22:57:40,848 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24 ms. Allocated memory is still 144.7 MB. Free memory was 120.9 MB in the beginning and 120.7 MB in the end (delta: 210.1 kB). Peak memory consumption was 210.1 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 319.26 ms. Allocated memory is still 144.7 MB. Free memory was 102.1 MB in the beginning and 92.4 MB in the end (delta: 9.7 MB). Peak memory consumption was 9.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 32.56 ms. Allocated memory is still 144.7 MB. Free memory was 92.4 MB in the beginning and 90.7 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 457.03 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 90.7 MB in the beginning and 164.6 MB in the end (delta: -73.9 MB). Peak memory consumption was 9.8 MB. Max. memory is 7.1 GB. * TraceAbstraction took 295786.26 ms. Allocated memory was 201.9 MB in the beginning and 267.4 MB in the end (delta: 65.5 MB). Free memory was 164.6 MB in the beginning and 223.9 MB in the end (delta: -59.4 MB). Peak memory consumption was 6.2 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] - GenericResult: Unfinished Backtranslation Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 15]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 31]: Loop Invariant [2020-07-17 22:57:40,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,856 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,857 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] [2020-07-17 22:57:40,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~y~0_13,QUANTIFIED] [2020-07-17 22:57:40,858 WARN L417 cessorBacktranslator]: Identifier is quantified, using identity as back-translation of IdentifierExpression[v_main_~x~0_13,QUANTIFIED] Derived loop invariant: (1 == x && 1 == y) || (\exists v_main_~y~0_13 : int, v_main_~x~0_13 : int :: (y == z * v_main_~y~0_13 && z * v_main_~x~0_13 + 1 == x) && z * v_main_~x~0_13 + 1 == z * v_main_~y~0_13 + v_main_~x~0_13) - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 24 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 256.6s, OverallIterations: 6, TraceHistogramMax: 4, AutomataDifference: 181.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 38.9s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 83 SDtfs, 40 SDslu, 253 SDs, 0 SdLazy, 179 SolverSat, 9 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 33.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 42.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 6 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 15 PreInvPairs, 25 NumberOfFragments, 90 HoareAnnotationTreeSize, 15 FomulaSimplifications, 222 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 97 FormulaSimplificationTreeSizeReductionInter, 36.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 65.1s InterpolantComputationTime, 115 NumberOfCodeBlocks, 101 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 109 ConstructedInterpolants, 5 QuantifiedInterpolants, 10860 SizeOfPredicates, 13 NumberOfNonLiveVariables, 265 ConjunctsInSsa, 67 ConjunctsInUnsatCore, 6 InterpolantComputations, 2 PerfectInterpolantSequences, 51/63 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...