/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCTransformed.xml -s ../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-06 12:59:48,458 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-06 12:59:48,459 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-06 12:59:48,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-06 12:59:48,496 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-06 12:59:48,497 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-06 12:59:48,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-06 12:59:48,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-06 12:59:48,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-06 12:59:48,512 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-06 12:59:48,513 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-06 12:59:48,513 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-06 12:59:48,514 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-06 12:59:48,514 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-06 12:59:48,515 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-06 12:59:48,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-06 12:59:48,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-06 12:59:48,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-06 12:59:48,518 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-06 12:59:48,519 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-06 12:59:48,520 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-06 12:59:48,524 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-06 12:59:48,525 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-06 12:59:48,528 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-06 12:59:48,530 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-06 12:59:48,537 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-06 12:59:48,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-06 12:59:48,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-06 12:59:48,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-06 12:59:48,539 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-06 12:59:48,540 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-06 12:59:48,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-06 12:59:48,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-06 12:59:48,543 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-06 12:59:48,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-06 12:59:48,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-06 12:59:48,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-06 12:59:48,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-06 12:59:48,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-06 12:59:48,545 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-06 12:59:48,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-06 12:59:48,548 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-06 12:59:48,549 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-06 12:59:48,573 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-06 12:59:48,573 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-06 12:59:48,574 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-06 12:59:48,574 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-06 12:59:48,575 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-06 12:59:48,575 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-06 12:59:48,575 INFO L138 SettingsManager]: * Use SBE=true [2022-04-06 12:59:48,577 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-06 12:59:48,578 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-06 12:59:48,578 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-06 12:59:48,578 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-06 12:59:48,579 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-06 12:59:48,579 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-06 12:59:48,579 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-06 12:59:48,579 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-06 12:59:48,579 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-06 12:59:48,579 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-06 12:59:48,579 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-06 12:59:48,580 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-06 12:59:48,580 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 12:59:48,580 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-06 12:59:48,580 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-06 12:59:48,580 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-06 12:59:48,581 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-06 12:59:48,581 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-06 12:59:48,581 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-06 12:59:48,581 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-06 12:59:48,581 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-06 12:59:48,582 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-06 12:59:48,582 INFO L138 SettingsManager]: * TransformationType=LOOP_ACCELERATION_QVASR WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-06 12:59:48,767 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-06 12:59:48,786 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-06 12:59:48,789 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-06 12:59:48,790 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-06 12:59:48,791 INFO L275 PluginConnector]: CDTParser initialized [2022-04-06 12:59:48,792 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-06 12:59:48,838 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353795801/b1eb192bf81e4a368289ddaea0e1e06a/FLAG3a96cf5fc [2022-04-06 12:59:49,161 INFO L306 CDTParser]: Found 1 translation units. [2022-04-06 12:59:49,161 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c [2022-04-06 12:59:49,166 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353795801/b1eb192bf81e4a368289ddaea0e1e06a/FLAG3a96cf5fc [2022-04-06 12:59:49,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/353795801/b1eb192bf81e4a368289ddaea0e1e06a [2022-04-06 12:59:49,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-06 12:59:49,599 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-06 12:59:49,604 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-06 12:59:49,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-06 12:59:49,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-06 12:59:49,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,608 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@af9604a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49, skipping insertion in model container [2022-04-06 12:59:49,608 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,613 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-06 12:59:49,623 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-06 12:59:49,758 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2022-04-06 12:59:49,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 12:59:49,777 INFO L203 MainTranslator]: Completed pre-run [2022-04-06 12:59:49,785 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/mannadiv_unwindbound20.c[573,586] [2022-04-06 12:59:49,789 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-06 12:59:49,797 INFO L208 MainTranslator]: Completed translation [2022-04-06 12:59:49,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49 WrapperNode [2022-04-06 12:59:49,798 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-06 12:59:49,798 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-06 12:59:49,799 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-06 12:59:49,799 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-06 12:59:49,807 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,807 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,811 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,811 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,815 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,821 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,829 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,830 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-06 12:59:49,831 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-06 12:59:49,831 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-06 12:59:49,831 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-06 12:59:49,832 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (1/1) ... [2022-04-06 12:59:49,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-06 12:59:49,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:49,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-06 12:59:49,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-06 12:59:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-06 12:59:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-06 12:59:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-06 12:59:49,886 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-06 12:59:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-06 12:59:49,887 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-06 12:59:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-06 12:59:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-06 12:59:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-06 12:59:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-06 12:59:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-06 12:59:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-06 12:59:49,887 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-06 12:59:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-06 12:59:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-06 12:59:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-06 12:59:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-06 12:59:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-06 12:59:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-06 12:59:49,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-06 12:59:49,937 INFO L234 CfgBuilder]: Building ICFG [2022-04-06 12:59:49,938 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-06 12:59:50,031 INFO L275 CfgBuilder]: Performing block encoding [2022-04-06 12:59:50,036 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-06 12:59:50,036 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-06 12:59:50,038 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 12:59:50 BoogieIcfgContainer [2022-04-06 12:59:50,038 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-06 12:59:50,038 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-06 12:59:50,038 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-06 12:59:50,039 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-06 12:59:50,041 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 12:59:50" (1/1) ... [2022-04-06 12:59:50,052 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-06 12:59:50,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 12:59:50 BasicIcfg [2022-04-06 12:59:50,065 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-06 12:59:50,088 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-06 12:59:50,088 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-06 12:59:50,092 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-06 12:59:50,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.04 12:59:49" (1/4) ... [2022-04-06 12:59:50,093 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d89166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 12:59:50, skipping insertion in model container [2022-04-06 12:59:50,093 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.04 12:59:49" (2/4) ... [2022-04-06 12:59:50,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d89166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.04 12:59:50, skipping insertion in model container [2022-04-06 12:59:50,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.04 12:59:50" (3/4) ... [2022-04-06 12:59:50,094 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@22d89166 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 12:59:50, skipping insertion in model container [2022-04-06 12:59:50,094 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 06.04 12:59:50" (4/4) ... [2022-04-06 12:59:50,095 INFO L111 eAbstractionObserver]: Analyzing ICFG mannadiv_unwindbound20.cqvasr [2022-04-06 12:59:50,099 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-06 12:59:50,099 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-06 12:59:50,150 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-06 12:59:50,159 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-06 12:59:50,159 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-06 12:59:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-06 12:59:50,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-06 12:59:50,183 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:50,184 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:50,184 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:50,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:50,188 INFO L85 PathProgramCache]: Analyzing trace with hash 734203501, now seen corresponding path program 1 times [2022-04-06 12:59:50,195 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:50,195 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054091782] [2022-04-06 12:59:50,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:50,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:50,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:50,359 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-06 12:59:50,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:50,369 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-06 12:59:50,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:50,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-06 12:59:50,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:50,382 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:50,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 12:59:50,382 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1054091782] [2022-04-06 12:59:50,383 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1054091782] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 12:59:50,383 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 12:59:50,383 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-06 12:59:50,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298676668] [2022-04-06 12:59:50,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 12:59:50,388 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-06 12:59:50,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 12:59:50,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-06 12:59:50,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 12:59:50,411 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 12:59:50,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 12:59:50,464 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-04-06 12:59:50,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-06 12:59:50,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-06 12:59:50,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 12:59:50,472 INFO L225 Difference]: With dead ends: 54 [2022-04-06 12:59:50,472 INFO L226 Difference]: Without dead ends: 26 [2022-04-06 12:59:50,474 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-06 12:59:50,477 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 12:59:50,478 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 35 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 12:59:50,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-04-06 12:59:50,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-04-06 12:59:50,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 12:59:50,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-06 12:59:50,514 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-06 12:59:50,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 12:59:50,515 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-06 12:59:50,515 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 12:59:50,515 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-06 12:59:50,516 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 12:59:50,516 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:50,517 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:50,517 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-06 12:59:50,517 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:50,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:50,518 INFO L85 PathProgramCache]: Analyzing trace with hash -1669026344, now seen corresponding path program 1 times [2022-04-06 12:59:50,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:50,518 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135700230] [2022-04-06 12:59:50,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:50,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:50,534 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 12:59:50,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1093674133] [2022-04-06 12:59:50,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:50,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:50,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:50,539 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 12:59:50,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-06 12:59:50,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:50,611 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-06 12:59:50,615 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 12:59:50,711 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:50,712 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 12:59:50,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 12:59:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135700230] [2022-04-06 12:59:50,712 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 12:59:50,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1093674133] [2022-04-06 12:59:50,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1093674133] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 12:59:50,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 12:59:50,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-06 12:59:50,714 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354918496] [2022-04-06 12:59:50,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 12:59:50,714 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-06 12:59:50,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 12:59:50,715 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-06 12:59:50,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 12:59:50,715 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 12:59:50,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 12:59:50,726 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-06 12:59:50,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-06 12:59:50,727 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-06 12:59:50,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 12:59:50,727 INFO L225 Difference]: With dead ends: 34 [2022-04-06 12:59:50,728 INFO L226 Difference]: Without dead ends: 27 [2022-04-06 12:59:50,728 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-06 12:59:50,729 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 12:59:50,730 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 12:59:50,730 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-06 12:59:50,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-06 12:59:50,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 12:59:50,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-06 12:59:50,736 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-06 12:59:50,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 12:59:50,737 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-06 12:59:50,737 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-06 12:59:50,737 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-06 12:59:50,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-06 12:59:50,737 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:50,738 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:50,754 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-06 12:59:50,938 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:50,939 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:50,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:50,940 INFO L85 PathProgramCache]: Analyzing trace with hash -1667953868, now seen corresponding path program 1 times [2022-04-06 12:59:50,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:50,940 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786819818] [2022-04-06 12:59:50,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:50,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:50,978 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 12:59:50,979 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1369206798] [2022-04-06 12:59:50,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:50,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:50,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:50,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 12:59:50,995 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-06 12:59:51,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:51,056 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-06 12:59:51,061 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 12:59:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-06 12:59:51,230 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-06 12:59:51,231 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 12:59:51,232 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786819818] [2022-04-06 12:59:51,233 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 12:59:51,233 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1369206798] [2022-04-06 12:59:51,233 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1369206798] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-06 12:59:51,233 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-06 12:59:51,233 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-06 12:59:51,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731806845] [2022-04-06 12:59:51,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-06 12:59:51,234 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 12:59:51,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 12:59:51,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 12:59:51,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-04-06 12:59:51,236 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 12:59:51,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 12:59:51,326 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-04-06 12:59:51,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 12:59:51,327 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-06 12:59:51,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 12:59:51,329 INFO L225 Difference]: With dead ends: 37 [2022-04-06 12:59:51,329 INFO L226 Difference]: Without dead ends: 35 [2022-04-06 12:59:51,330 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-04-06 12:59:51,332 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 19 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 12:59:51,334 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 108 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 12:59:51,335 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-06 12:59:51,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 32. [2022-04-06 12:59:51,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.2) internal successors, (24), 22 states have internal predecessors, (24), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-06 12:59:51,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2022-04-06 12:59:51,341 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 23 [2022-04-06 12:59:51,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 12:59:51,342 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2022-04-06 12:59:51,342 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-06 12:59:51,342 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2022-04-06 12:59:51,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-06 12:59:51,343 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:51,348 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:51,365 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-06 12:59:51,551 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-06 12:59:51,551 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:51,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:51,552 INFO L85 PathProgramCache]: Analyzing trace with hash 1179905874, now seen corresponding path program 1 times [2022-04-06 12:59:51,553 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:51,553 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174164165] [2022-04-06 12:59:51,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:51,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:51,565 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 12:59:51,566 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [484550527] [2022-04-06 12:59:51,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:51,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:51,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:51,567 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 12:59:51,601 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-06 12:59:51,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:51,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-06 12:59:51,621 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 12:59:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:51,756 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 12:59:51,923 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:51,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 12:59:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174164165] [2022-04-06 12:59:51,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 12:59:51,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [484550527] [2022-04-06 12:59:51,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [484550527] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 12:59:51,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 12:59:51,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-06 12:59:51,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1263016883] [2022-04-06 12:59:51,925 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 12:59:51,925 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-06 12:59:51,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 12:59:51,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-06 12:59:51,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-06 12:59:51,926 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 12:59:52,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 12:59:52,012 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2022-04-06 12:59:52,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-06 12:59:52,013 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) Word has length 29 [2022-04-06 12:59:52,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 12:59:52,016 INFO L225 Difference]: With dead ends: 39 [2022-04-06 12:59:52,016 INFO L226 Difference]: Without dead ends: 34 [2022-04-06 12:59:52,017 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-06 12:59:52,018 INFO L913 BasicCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 12:59:52,018 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 104 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 12:59:52,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-06 12:59:52,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 29. [2022-04-06 12:59:52,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-06 12:59:52,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-06 12:59:52,026 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-06 12:59:52,026 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 12:59:52,027 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-06 12:59:52,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.111111111111111) internal successors, (19), 7 states have internal predecessors, (19), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (5), 3 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-06 12:59:52,027 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-06 12:59:52,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-06 12:59:52,028 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:52,028 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:52,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-06 12:59:52,243 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:52,244 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:52,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:52,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1668946595, now seen corresponding path program 1 times [2022-04-06 12:59:52,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:52,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844195503] [2022-04-06 12:59:52,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:52,245 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:52,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 12:59:52,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1710885376] [2022-04-06 12:59:52,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:52,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:52,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:52,257 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 12:59:52,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-06 12:59:52,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-06 12:59:52,305 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-06 12:59:52,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 12:59:52,382 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:52,382 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 12:59:52,468 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:52,468 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 12:59:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844195503] [2022-04-06 12:59:52,468 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 12:59:52,468 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710885376] [2022-04-06 12:59:52,468 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1710885376] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 12:59:52,469 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 12:59:52,469 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-06 12:59:52,469 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567462930] [2022-04-06 12:59:52,469 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 12:59:52,470 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-06 12:59:52,470 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 12:59:52,470 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-06 12:59:52,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-06 12:59:52,471 INFO L87 Difference]: Start difference. First operand 29 states and 31 transitions. Second operand has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-06 12:59:52,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 12:59:52,531 INFO L93 Difference]: Finished difference Result 61 states and 68 transitions. [2022-04-06 12:59:52,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-06 12:59:52,532 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) Word has length 32 [2022-04-06 12:59:52,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 12:59:52,534 INFO L225 Difference]: With dead ends: 61 [2022-04-06 12:59:52,534 INFO L226 Difference]: Without dead ends: 56 [2022-04-06 12:59:52,535 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-04-06 12:59:52,537 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-06 12:59:52,539 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 94 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-06 12:59:52,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-06 12:59:52,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-06 12:59:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-06 12:59:52,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-06 12:59:52,561 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 32 [2022-04-06 12:59:52,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 12:59:52,562 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-06 12:59:52,564 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.375) internal successors, (35), 8 states have internal predecessors, (35), 6 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 5 states have call successors, (8) [2022-04-06 12:59:52,564 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-06 12:59:52,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-06 12:59:52,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:52,566 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:52,591 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-06 12:59:52,766 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:52,766 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:52,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:52,767 INFO L85 PathProgramCache]: Analyzing trace with hash -906969448, now seen corresponding path program 2 times [2022-04-06 12:59:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:52,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487828659] [2022-04-06 12:59:52,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:52,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:52,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 12:59:52,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [858335074] [2022-04-06 12:59:52,779 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-06 12:59:52,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:52,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:52,782 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 12:59:52,785 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-06 12:59:52,828 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-06 12:59:52,828 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 12:59:52,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-06 12:59:52,831 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 12:59:52,981 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:52,981 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 12:59:53,155 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-06 12:59:53,156 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 12:59:53,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487828659] [2022-04-06 12:59:53,156 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 12:59:53,156 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [858335074] [2022-04-06 12:59:53,156 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [858335074] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 12:59:53,156 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 12:59:53,156 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-06 12:59:53,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874727081] [2022-04-06 12:59:53,157 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 12:59:53,158 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-06 12:59:53,159 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 12:59:53,159 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-06 12:59:53,159 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-06 12:59:53,161 INFO L87 Difference]: Start difference. First operand 56 states and 61 transitions. Second operand has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-06 12:59:53,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 12:59:53,315 INFO L93 Difference]: Finished difference Result 115 states and 131 transitions. [2022-04-06 12:59:53,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-06 12:59:53,316 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) Word has length 59 [2022-04-06 12:59:53,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 12:59:53,321 INFO L225 Difference]: With dead ends: 115 [2022-04-06 12:59:53,321 INFO L226 Difference]: Without dead ends: 110 [2022-04-06 12:59:53,322 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-04-06 12:59:53,324 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 104 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 12:59:53,325 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 176 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 12:59:53,326 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-06 12:59:53,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-06 12:59:53,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-06 12:59:53,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-06 12:59:53,345 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 59 [2022-04-06 12:59:53,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 12:59:53,345 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-06 12:59:53,345 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.857142857142857) internal successors, (68), 14 states have internal predecessors, (68), 12 states have call successors, (16), 8 states have call predecessors, (16), 7 states have return successors, (14), 10 states have call predecessors, (14), 11 states have call successors, (14) [2022-04-06 12:59:53,345 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-06 12:59:53,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-06 12:59:53,351 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:53,353 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:53,382 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-06 12:59:53,579 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:53,580 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:53,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:53,580 INFO L85 PathProgramCache]: Analyzing trace with hash 191644600, now seen corresponding path program 3 times [2022-04-06 12:59:53,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:53,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071998820] [2022-04-06 12:59:53,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:53,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:53,596 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 12:59:53,596 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [757912274] [2022-04-06 12:59:53,596 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-04-06 12:59:53,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:53,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:53,598 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 12:59:53,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-06 12:59:53,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-04-06 12:59:53,675 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-06 12:59:53,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 323 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-06 12:59:53,680 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-06 12:59:53,944 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-06 12:59:53,944 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-06 12:59:54,269 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-06 12:59:54,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-06 12:59:54,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071998820] [2022-04-06 12:59:54,270 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-06 12:59:54,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [757912274] [2022-04-06 12:59:54,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [757912274] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-06 12:59:54,270 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-06 12:59:54,272 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-06 12:59:54,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633136988] [2022-04-06 12:59:54,272 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-06 12:59:54,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-04-06 12:59:54,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-06 12:59:54,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-04-06 12:59:54,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-06 12:59:54,274 INFO L87 Difference]: Start difference. First operand 110 states and 121 transitions. Second operand has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-06 12:59:54,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-06 12:59:54,639 INFO L93 Difference]: Finished difference Result 205 states and 235 transitions. [2022-04-06 12:59:54,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-06 12:59:54,640 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) Word has length 113 [2022-04-06 12:59:54,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-06 12:59:54,641 INFO L225 Difference]: With dead ends: 205 [2022-04-06 12:59:54,641 INFO L226 Difference]: Without dead ends: 200 [2022-04-06 12:59:54,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2022-04-06 12:59:54,643 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 248 mSDsluCounter, 239 mSDsCounter, 0 mSdLazyCounter, 121 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 121 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-06 12:59:54,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [248 Valid, 284 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 121 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-06 12:59:54,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-06 12:59:54,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-06 12:59:54,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-06 12:59:54,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-04-06 12:59:54,660 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 113 [2022-04-06 12:59:54,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-06 12:59:54,661 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-04-06 12:59:54,661 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.416666666666667) internal successors, (130), 24 states have internal predecessors, (130), 22 states have call successors, (28), 13 states have call predecessors, (28), 12 states have return successors, (26), 20 states have call predecessors, (26), 21 states have call successors, (26) [2022-04-06 12:59:54,661 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-06 12:59:54,664 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-06 12:59:54,664 INFO L491 BasicCegarLoop]: Found error trace [2022-04-06 12:59:54,664 INFO L499 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-06 12:59:54,691 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-06 12:59:54,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:54,882 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-06 12:59:54,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-06 12:59:54,882 INFO L85 PathProgramCache]: Analyzing trace with hash -2040315496, now seen corresponding path program 4 times [2022-04-06 12:59:54,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-06 12:59:54,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847797718] [2022-04-06 12:59:54,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-06 12:59:54,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-06 12:59:54,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-06 12:59:54,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [915197228] [2022-04-06 12:59:54,898 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-06 12:59:54,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:54,899 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-06 12:59:54,899 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-06 12:59:54,901 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-06 12:59:55,012 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-06 12:59:55,012 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-06 12:59:55,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-06 12:59:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-06 12:59:55,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-06 12:59:55,221 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-06 12:59:55,222 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-06 12:59:55,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-06 12:59:55,446 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-06 12:59:55,449 INFO L719 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2022-04-06 12:59:55,452 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-06 12:59:55,522 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.04 12:59:55 BasicIcfg [2022-04-06 12:59:55,522 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-06 12:59:55,522 INFO L158 Benchmark]: Toolchain (without parser) took 5923.81ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 125.7MB in the beginning and 105.2MB in the end (delta: 20.5MB). Peak memory consumption was 56.3MB. Max. memory is 8.0GB. [2022-04-06 12:59:55,523 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-06 12:59:55,523 INFO L158 Benchmark]: CACSL2BoogieTranslator took 193.59ms. Allocated memory is still 177.2MB. Free memory was 125.6MB in the beginning and 157.5MB in the end (delta: -32.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-06 12:59:55,523 INFO L158 Benchmark]: Boogie Preprocessor took 32.01ms. Allocated memory is still 177.2MB. Free memory was 157.5MB in the beginning and 156.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 12:59:55,523 INFO L158 Benchmark]: RCFGBuilder took 206.91ms. Allocated memory is still 177.2MB. Free memory was 155.9MB in the beginning and 144.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-06 12:59:55,524 INFO L158 Benchmark]: IcfgTransformer took 26.48ms. Allocated memory is still 177.2MB. Free memory was 144.9MB in the beginning and 143.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-06 12:59:55,524 INFO L158 Benchmark]: TraceAbstraction took 5433.91ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 142.8MB in the beginning and 105.2MB in the end (delta: 37.6MB). Peak memory consumption was 74.3MB. Max. memory is 8.0GB. [2022-04-06 12:59:55,525 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 177.2MB. Free memory is still 141.6MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 193.59ms. Allocated memory is still 177.2MB. Free memory was 125.6MB in the beginning and 157.5MB in the end (delta: -32.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.01ms. Allocated memory is still 177.2MB. Free memory was 157.5MB in the beginning and 156.4MB in the end (delta: 1.2MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 206.91ms. Allocated memory is still 177.2MB. Free memory was 155.9MB in the beginning and 144.9MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 26.48ms. Allocated memory is still 177.2MB. Free memory was 144.9MB in the beginning and 143.4MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 5433.91ms. Allocated memory was 177.2MB in the beginning and 212.9MB in the end (delta: 35.7MB). Free memory was 142.8MB in the beginning and 105.2MB in the end (delta: 37.6MB). Peak memory consumption was 74.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=24, counter=0] [L24] int x1, x2; [L25] int y1, y2, y3; [L26] x1 = __VERIFIER_nondet_int() [L27] x2 = __VERIFIER_nondet_int() [L29] CALL assume_abort_if_not(x1 >= 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L29] RET assume_abort_if_not(x1 >= 0) VAL [\old(counter)=0, counter=0, x1=21, x2=1] [L30] CALL assume_abort_if_not(x2 != 0) VAL [\old(cond)=1, \old(counter)=0, counter=0] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=0] [L30] RET assume_abort_if_not(x2 != 0) VAL [\old(counter)=0, counter=0, x1=21, x2=1] [L32] y1 = 0 [L33] y2 = 0 [L34] y3 = x1 VAL [\old(counter)=0, counter=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] EXPR counter++ VAL [\old(counter)=0, counter=1, counter++=0, x1=21, x2=1, y1=0, y2=0, y3=21] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=0, y2=0, y3=21] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] EXPR counter++ VAL [\old(counter)=0, counter=2, counter++=1, x1=21, x2=1, y1=1, y2=0, y3=20] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=2] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=2] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=1, y2=0, y3=20] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] EXPR counter++ VAL [\old(counter)=0, counter=3, counter++=2, x1=21, x2=1, y1=2, y2=0, y3=19] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=3] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=3] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=2, y2=0, y3=19] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] EXPR counter++ VAL [\old(counter)=0, counter=4, counter++=3, x1=21, x2=1, y1=3, y2=0, y3=18] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=4] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=4] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=3, y2=0, y3=18] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] EXPR counter++ VAL [\old(counter)=0, counter=5, counter++=4, x1=21, x2=1, y1=4, y2=0, y3=17] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=5] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=5] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=4, y2=0, y3=17] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] EXPR counter++ VAL [\old(counter)=0, counter=6, counter++=5, x1=21, x2=1, y1=5, y2=0, y3=16] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=6] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=6] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=5, y2=0, y3=16] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] EXPR counter++ VAL [\old(counter)=0, counter=7, counter++=6, x1=21, x2=1, y1=6, y2=0, y3=15] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=7] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=7] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=6, y2=0, y3=15] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] EXPR counter++ VAL [\old(counter)=0, counter=8, counter++=7, x1=21, x2=1, y1=7, y2=0, y3=14] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=8] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=8] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=7, y2=0, y3=14] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] EXPR counter++ VAL [\old(counter)=0, counter=9, counter++=8, x1=21, x2=1, y1=8, y2=0, y3=13] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=9] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=9] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=8, y2=0, y3=13] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] EXPR counter++ VAL [\old(counter)=0, counter=10, counter++=9, x1=21, x2=1, y1=9, y2=0, y3=12] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=10] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=10] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=9, y2=0, y3=12] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] EXPR counter++ VAL [\old(counter)=0, counter=11, counter++=10, x1=21, x2=1, y1=10, y2=0, y3=11] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=11] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=11] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=10, y2=0, y3=11] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] EXPR counter++ VAL [\old(counter)=0, counter=12, counter++=11, x1=21, x2=1, y1=11, y2=0, y3=10] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=12] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=12] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=11, y2=0, y3=10] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] EXPR counter++ VAL [\old(counter)=0, counter=13, counter++=12, x1=21, x2=1, y1=12, y2=0, y3=9] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=13] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=13] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=12, y2=0, y3=9] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] EXPR counter++ VAL [\old(counter)=0, counter=14, counter++=13, x1=21, x2=1, y1=13, y2=0, y3=8] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=14] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=14] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=13, y2=0, y3=8] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] EXPR counter++ VAL [\old(counter)=0, counter=15, counter++=14, x1=21, x2=1, y1=14, y2=0, y3=7] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=15] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=15] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=14, y2=0, y3=7] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] EXPR counter++ VAL [\old(counter)=0, counter=16, counter++=15, x1=21, x2=1, y1=15, y2=0, y3=6] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=16] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=16] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=15, y2=0, y3=6] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] EXPR counter++ VAL [\old(counter)=0, counter=17, counter++=16, x1=21, x2=1, y1=16, y2=0, y3=5] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=17] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=17] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=16, y2=0, y3=5] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] EXPR counter++ VAL [\old(counter)=0, counter=18, counter++=17, x1=21, x2=1, y1=17, y2=0, y3=4] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=18] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=18] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=17, y2=0, y3=4] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] EXPR counter++ VAL [\old(counter)=0, counter=19, counter++=18, x1=21, x2=1, y1=18, y2=0, y3=3] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=19] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=19] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=18, y2=0, y3=3] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] EXPR counter++ VAL [\old(counter)=0, counter=20, counter++=19, x1=21, x2=1, y1=19, y2=0, y3=2] [L36] COND TRUE counter++<20 [L37] CALL __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(cond)=1, \old(counter)=0, counter=20] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=20] [L37] RET __VERIFIER_assert(y1*x2 + y2 + y3 == x1) VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L39] COND FALSE !(!(y3 != 0)) VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=19, y2=0, y3=2] [L41] COND TRUE y2 + 1 == x2 [L42] y1 = y1 + 1 [L43] y2 = 0 [L44] y3 = y3 - 1 VAL [\old(counter)=0, counter=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] EXPR counter++ VAL [\old(counter)=0, counter=21, counter++=20, x1=21, x2=1, y1=20, y2=0, y3=1] [L36] COND FALSE !(counter++<20) [L50] CALL __VERIFIER_assert(y1*x2 + y2 == x1) VAL [\old(cond)=0, \old(counter)=0, counter=21] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 5.3s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 442 SdHoareTripleChecker+Valid, 0.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 438 mSDsluCounter, 868 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 660 mSDsCounter, 165 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 363 IncrementalHoareTripleChecker+Invalid, 528 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 165 mSolverCounterUnsat, 208 mSDtfsCounter, 363 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 552 GetRequests, 457 SyntacticMatches, 2 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 314 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=7, InterpolantAutomatonStates: 97, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 9 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 504 NumberOfCodeBlocks, 504 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 523 ConstructedInterpolants, 0 QuantifiedInterpolants, 1255 SizeOfPredicates, 29 NumberOfNonLiveVariables, 914 ConjunctsInSsa, 74 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 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 incorrect! [2022-04-06 12:59:55,556 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...