/usr/bin/java -ea -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/lcm2_valuebound10.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 01:57:05,552 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 01:57:05,553 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 01:57:05,576 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 01:57:05,577 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 01:57:05,578 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 01:57:05,579 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 01:57:05,581 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 01:57:05,583 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 01:57:05,584 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 01:57:05,585 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 01:57:05,586 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 01:57:05,586 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 01:57:05,587 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 01:57:05,588 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 01:57:05,589 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 01:57:05,589 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 01:57:05,590 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 01:57:05,591 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 01:57:05,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 01:57:05,594 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 01:57:05,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 01:57:05,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 01:57:05,596 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 01:57:05,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 01:57:05,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 01:57:05,600 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 01:57:05,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 01:57:05,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 01:57:05,601 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 01:57:05,602 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 01:57:05,602 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 01:57:05,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 01:57:05,603 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 01:57:05,604 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 01:57:05,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 01:57:05,605 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 01:57:05,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 01:57:05,606 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 01:57:05,606 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 01:57:05,607 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 01:57:05,607 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 01:57:05,608 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-08 01:57:05,627 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 01:57:05,628 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 01:57:05,628 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-08 01:57:05,629 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-08 01:57:05,629 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-08 01:57:05,629 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-08 01:57:05,630 INFO L138 SettingsManager]: * Use SBE=true [2022-04-08 01:57:05,630 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 01:57:05,630 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 01:57:05,630 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 01:57:05,631 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 01:57:05,631 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 01:57:05,631 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 01:57:05,631 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 01:57:05,632 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 01:57:05,632 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 01:57:05,632 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 01:57:05,632 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 01:57:05,633 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 01:57:05,633 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:57:05,633 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 01:57:05,633 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-08 01:57:05,634 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-08 01:57:05,634 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-08 01:57:05,634 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-08 01:57:05,634 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 01:57:05,634 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-08 01:57:05,635 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-08 01:57:05,636 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-08 01:57:05,636 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-08 01:57:05,828 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 01:57:05,847 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 01:57:05,850 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 01:57:05,851 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 01:57:05,852 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 01:57:05,853 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound10.c [2022-04-08 01:57:05,912 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c284286/ac233b5b1785488691ac2da2d9cd02c2/FLAG1a31a28f2 [2022-04-08 01:57:06,271 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 01:57:06,272 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm2_valuebound10.c [2022-04-08 01:57:06,277 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c284286/ac233b5b1785488691ac2da2d9cd02c2/FLAG1a31a28f2 [2022-04-08 01:57:06,286 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16c284286/ac233b5b1785488691ac2da2d9cd02c2 [2022-04-08 01:57:06,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 01:57:06,289 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-08 01:57:06,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 01:57:06,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 01:57:06,294 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 01:57:06,295 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,296 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23a1876f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06, skipping insertion in model container [2022-04-08 01:57:06,296 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,300 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 01:57:06,311 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 01:57:06,449 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/lcm2_valuebound10.c[537,550] [2022-04-08 01:57:06,462 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:57:06,471 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 01:57:06,481 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/lcm2_valuebound10.c[537,550] [2022-04-08 01:57:06,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 01:57:06,498 INFO L208 MainTranslator]: Completed translation [2022-04-08 01:57:06,499 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06 WrapperNode [2022-04-08 01:57:06,499 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 01:57:06,502 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 01:57:06,502 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 01:57:06,503 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 01:57:06,511 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,511 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,516 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,516 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,523 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,526 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,535 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,537 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 01:57:06,538 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 01:57:06,538 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 01:57:06,538 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 01:57:06,539 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 01:57:06,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:57:06,562 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-08 01:57:06,576 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-08 01:57:06,601 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 01:57:06,602 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 01:57:06,602 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 01:57:06,602 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 01:57:06,602 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 01:57:06,603 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 01:57:06,604 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 01:57:06,604 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 01:57:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 01:57:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 01:57:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-08 01:57:06,606 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 01:57:06,607 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 01:57:06,652 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 01:57:06,653 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 01:57:06,807 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 01:57:06,815 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 01:57:06,815 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 01:57:06,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:57:06 BoogieIcfgContainer [2022-04-08 01:57:06,816 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 01:57:06,817 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-08 01:57:06,817 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-08 01:57:06,819 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-08 01:57:06,822 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:57:06" (1/1) ... [2022-04-08 01:57:06,824 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-08 01:57:06,848 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:57:06 BasicIcfg [2022-04-08 01:57:06,848 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-08 01:57:06,849 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 01:57:06,849 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 01:57:06,852 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 01:57:06,852 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:57:06" (1/4) ... [2022-04-08 01:57:06,852 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dc01d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:57:06, skipping insertion in model container [2022-04-08 01:57:06,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:57:06" (2/4) ... [2022-04-08 01:57:06,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dc01d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:57:06, skipping insertion in model container [2022-04-08 01:57:06,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:57:06" (3/4) ... [2022-04-08 01:57:06,853 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48dc01d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 01:57:06, skipping insertion in model container [2022-04-08 01:57:06,853 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 08.04 01:57:06" (4/4) ... [2022-04-08 01:57:06,854 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm2_valuebound10.cqvasr [2022-04-08 01:57:06,858 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-08 01:57:06,858 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 01:57:06,895 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 01:57:06,900 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-08 01:57:06,900 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 01:57:06,921 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 01:57:06,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 01:57:06,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:57:06,926 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:57:06,927 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:57:06,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:57:06,931 INFO L85 PathProgramCache]: Analyzing trace with hash -419271626, now seen corresponding path program 1 times [2022-04-08 01:57:06,938 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:57:06,938 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [683668905] [2022-04-08 01:57:06,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:57:06,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:57:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,120 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 01:57:07,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [84] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-08 01:57:07,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [87] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 01:57:07,139 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37#true} {37#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 01:57:07,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 01:57:07,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,148 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,149 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,149 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {37#true} [118] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_10 4294967296) 10) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-08 01:57:07,149 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-08 01:57:07,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,157 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,158 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,158 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [119] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~b~0_9 4294967296) 10) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 01:57:07,159 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-08 01:57:07,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,167 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [120] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-08 01:57:07,168 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-08 01:57:07,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,181 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,182 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,182 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 01:57:07,183 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2022-04-08 01:57:07,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,191 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [122] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-08 01:57:07,191 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 32 [2022-04-08 01:57:07,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,198 INFO L290 TraceCheckUtils]: 2: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,199 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38#false} {38#false} [123] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 01:57:07,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {37#true} [82] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 01:57:07,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {66#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [84] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {37#true} is VALID [2022-04-08 01:57:07,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {37#true} [87] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 01:57:07,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {37#true} {37#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 01:57:07,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {37#true} [83] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {37#true} is VALID [2022-04-08 01:57:07,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {37#true} [86] mainENTRY-->L23: Formula: (= v_main_~a~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_1, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {37#true} is VALID [2022-04-08 01:57:07,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {37#true} [88] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_10 4294967296) 10) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {37#true} is VALID [2022-04-08 01:57:07,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,203 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38#false} {37#true} [118] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_10 4294967296) 10) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-08 01:57:07,203 INFO L290 TraceCheckUtils]: 11: Hoare triple {38#false} [89] L23-1-->L25: Formula: (= v_main_~b~0_3 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~b~0] {38#false} is VALID [2022-04-08 01:57:07,203 INFO L272 TraceCheckUtils]: 12: Hoare triple {38#false} [91] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~b~0_9 4294967296) 10) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 01:57:07,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,205 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {38#false} {38#false} [119] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~b~0_9 4294967296) 10) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 01:57:07,205 INFO L272 TraceCheckUtils]: 17: Hoare triple {38#false} [94] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {37#true} is VALID [2022-04-08 01:57:07,205 INFO L290 TraceCheckUtils]: 18: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,206 INFO L290 TraceCheckUtils]: 19: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,206 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {38#false} {38#false} [120] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-08 01:57:07,206 INFO L272 TraceCheckUtils]: 22: Hoare triple {38#false} [96] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 01:57:07,207 INFO L290 TraceCheckUtils]: 23: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,208 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {38#false} {38#false} [121] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 01:57:07,208 INFO L272 TraceCheckUtils]: 27: Hoare triple {38#false} [97] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {37#true} is VALID [2022-04-08 01:57:07,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,209 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38#false} {38#false} [122] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {38#false} is VALID [2022-04-08 01:57:07,210 INFO L272 TraceCheckUtils]: 32: Hoare triple {38#false} [98] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {37#true} is VALID [2022-04-08 01:57:07,210 INFO L290 TraceCheckUtils]: 33: Hoare triple {37#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {37#true} is VALID [2022-04-08 01:57:07,211 INFO L290 TraceCheckUtils]: 34: Hoare triple {37#true} [92] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,211 INFO L290 TraceCheckUtils]: 35: Hoare triple {38#false} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,211 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {38#false} {38#false} [123] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {38#false} is VALID [2022-04-08 01:57:07,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {38#false} [99] L30-->L43-2: Formula: (and (= v_main_~a~0_8 v_main_~v~0_6) (= v_main_~b~0_7 v_main_~y~0_7) (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~a~0_8 v_main_~x~0_7)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_8} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {38#false} is VALID [2022-04-08 01:57:07,212 INFO L290 TraceCheckUtils]: 38: Hoare triple {38#false} [100] L43-2-->L37-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,212 INFO L272 TraceCheckUtils]: 39: Hoare triple {38#false} [103] L37-2-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_2| (ite (= (mod (* (* 2 v_main_~a~0_14) v_main_~b~0_13) 4294967296) (mod (+ (* v_main_~x~0_11 v_main_~u~0_9) (* v_main_~y~0_11 v_main_~v~0_9)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_9, main_~x~0=v_main_~x~0_11, main_~y~0=v_main_~y~0_11, main_~b~0=v_main_~b~0_13, main_~u~0=v_main_~u~0_9, main_~a~0=v_main_~a~0_14} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {38#false} is VALID [2022-04-08 01:57:07,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {38#false} [106] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {38#false} is VALID [2022-04-08 01:57:07,212 INFO L290 TraceCheckUtils]: 41: Hoare triple {38#false} [110] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {38#false} [114] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {38#false} is VALID [2022-04-08 01:57:07,213 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 01:57:07,214 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:57:07,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [683668905] [2022-04-08 01:57:07,215 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [683668905] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:57:07,215 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:57:07,215 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 01:57:07,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031349447] [2022-04-08 01:57:07,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:57:07,222 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-08 01:57:07,224 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:57:07,227 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 01:57:07,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:57:07,281 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 01:57:07,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:57:07,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 01:57:07,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 01:57:07,313 INFO L87 Difference]: Start difference. First operand has 34 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 10 states have call successors, (10), 4 states have call predecessors, (10), 4 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 01:57:07,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:57:07,508 INFO L93 Difference]: Finished difference Result 61 states and 90 transitions. [2022-04-08 01:57:07,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 01:57:07,510 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 43 [2022-04-08 01:57:07,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:57:07,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 01:57:07,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-08 01:57:07,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 01:57:07,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 90 transitions. [2022-04-08 01:57:07,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 90 transitions. [2022-04-08 01:57:07,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:57:07,640 INFO L225 Difference]: With dead ends: 61 [2022-04-08 01:57:07,640 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 01:57:07,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 21 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-08 01:57:07,645 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 01:57:07,647 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 36 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 01:57:07,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 01:57:07,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 01:57:07,673 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:57:07,674 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:57:07,675 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:57:07,675 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:57:07,679 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:57:07,679 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-08 01:57:07,679 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 01:57:07,680 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:57:07,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:57:07,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 29 states. [2022-04-08 01:57:07,681 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 29 states. [2022-04-08 01:57:07,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:57:07,685 INFO L93 Difference]: Finished difference Result 29 states and 36 transitions. [2022-04-08 01:57:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 01:57:07,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:57:07,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:57:07,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:57:07,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:57:07,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 10 states have call successors, (10), 4 states have call predecessors, (10), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 01:57:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-04-08 01:57:07,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 43 [2022-04-08 01:57:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:57:07,689 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-04-08 01:57:07,690 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-08 01:57:07,690 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-04-08 01:57:07,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-08 01:57:07,691 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:57:07,691 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:57:07,691 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 01:57:07,691 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:57:07,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:57:07,692 INFO L85 PathProgramCache]: Analyzing trace with hash -1223303911, now seen corresponding path program 1 times [2022-04-08 01:57:07,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:57:07,692 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711099123] [2022-04-08 01:57:07,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:57:07,693 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:57:07,731 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:57:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [645311770] [2022-04-08 01:57:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:57:07,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:57:07,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:57:07,734 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-08 01:57:07,742 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-08 01:57:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,812 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 30 conjunts are in the unsatisfiable core [2022-04-08 01:57:07,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 01:57:07,842 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 01:57:08,462 INFO L272 TraceCheckUtils]: 0: Hoare triple {257#true} [82] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {257#true} [84] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1)) (.cse1 (select |v_#memory_int_1| 2))) (and (= 48 (select .cse0 0)) (= 108 (select .cse1 0)) (= (select .cse1 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse1 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= (select .cse1 2) 109) (= (select |v_#valid_1| 1) 1) (= (select .cse1 3) 50) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse1 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse1 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {257#true} is VALID [2022-04-08 01:57:08,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {257#true} [87] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {257#true} {257#true} [117] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {257#true} [83] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,467 INFO L290 TraceCheckUtils]: 5: Hoare triple {257#true} [86] mainENTRY-->L23: Formula: (= v_main_~a~0_1 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_5, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_1, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {257#true} is VALID [2022-04-08 01:57:08,467 INFO L272 TraceCheckUtils]: 6: Hoare triple {257#true} [88] L23-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_10 4294967296) 10) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {257#true} is VALID [2022-04-08 01:57:08,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {257#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#true} is VALID [2022-04-08 01:57:08,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {257#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {257#true} {257#true} [118] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_10 4294967296) 10) 1 0) |v_assume_abort_if_not_#in~condInParam_1|) InVars {main_~a~0=v_main_~a~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {257#true} is VALID [2022-04-08 01:57:08,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {257#true} [89] L23-1-->L25: Formula: (= v_main_~b~0_3 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~b~0=v_main_~b~0_3} AuxVars[] AssignedVars[main_#t~nondet5, main_~b~0] {257#true} is VALID [2022-04-08 01:57:08,469 INFO L272 TraceCheckUtils]: 12: Hoare triple {257#true} [91] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~b~0_9 4294967296) 10) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {257#true} is VALID [2022-04-08 01:57:08,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {257#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#true} is VALID [2022-04-08 01:57:08,471 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,471 INFO L290 TraceCheckUtils]: 15: Hoare triple {257#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,471 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {257#true} {257#true} [119] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~b~0_9 4294967296) 10) 1 0)) InVars {main_~b~0=v_main_~b~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {257#true} is VALID [2022-04-08 01:57:08,471 INFO L272 TraceCheckUtils]: 17: Hoare triple {257#true} [94] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {257#true} is VALID [2022-04-08 01:57:08,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {257#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#true} is VALID [2022-04-08 01:57:08,472 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {257#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,472 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {257#true} {257#true} [120] assume_abort_if_notEXIT-->L26: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (<= 1 (mod v_main_~a~0_11 4294967296)) 1 0)) InVars {main_~a~0=v_main_~a~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {257#true} is VALID [2022-04-08 01:57:08,472 INFO L272 TraceCheckUtils]: 22: Hoare triple {257#true} [96] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {257#true} is VALID [2022-04-08 01:57:08,473 INFO L290 TraceCheckUtils]: 23: Hoare triple {257#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#true} is VALID [2022-04-08 01:57:08,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {257#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,474 INFO L290 TraceCheckUtils]: 25: Hoare triple {257#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,474 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {257#true} {257#true} [121] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (<= 1 (mod v_main_~b~0_10 4294967296)) 1 0)) InVars {main_~b~0=v_main_~b~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {257#true} is VALID [2022-04-08 01:57:08,474 INFO L272 TraceCheckUtils]: 27: Hoare triple {257#true} [97] L27-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {257#true} is VALID [2022-04-08 01:57:08,474 INFO L290 TraceCheckUtils]: 28: Hoare triple {257#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#true} is VALID [2022-04-08 01:57:08,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {257#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,476 INFO L290 TraceCheckUtils]: 30: Hoare triple {257#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,477 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {257#true} {257#true} [122] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_5|) InVars {main_~a~0=v_main_~a~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_5|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {257#true} is VALID [2022-04-08 01:57:08,478 INFO L272 TraceCheckUtils]: 32: Hoare triple {257#true} [98] L29-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {257#true} is VALID [2022-04-08 01:57:08,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {257#true} [90] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#true} is VALID [2022-04-08 01:57:08,480 INFO L290 TraceCheckUtils]: 34: Hoare triple {257#true} [93] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {257#true} [95] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {257#true} is VALID [2022-04-08 01:57:08,480 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {257#true} {257#true} [123] assume_abort_if_notEXIT-->L30: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_6| (ite (<= (mod v_main_~b~0_11 4294967296) 65535) 1 0)) InVars {main_~b~0=v_main_~b~0_11} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_6|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {257#true} is VALID [2022-04-08 01:57:08,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {257#true} [99] L30-->L43-2: Formula: (and (= v_main_~a~0_8 v_main_~v~0_6) (= v_main_~b~0_7 v_main_~y~0_7) (= v_main_~b~0_7 v_main_~u~0_6) (= v_main_~a~0_8 v_main_~x~0_7)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_8} OutVars{main_~v~0=v_main_~v~0_6, main_~x~0=v_main_~x~0_7, main_~y~0=v_main_~y~0_7, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_6, main_~a~0=v_main_~a~0_8} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {373#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 01:57:08,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {373#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [102] L43-2-->L38: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {373#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-08 01:57:08,482 INFO L272 TraceCheckUtils]: 39: Hoare triple {373#(and (= main_~a~0 main_~v~0) (= main_~b~0 main_~y~0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [104] L38-->__VERIFIER_assertENTRY: Formula: (= (ite (= (mod (+ (* v_main_~y~0_10 v_main_~v~0_8) (* v_main_~x~0_10 v_main_~u~0_8)) 4294967296) (mod (* (* 2 v_main_~a~0_13) v_main_~b~0_12) 4294967296)) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_8, main_~x~0=v_main_~x~0_10, main_~y~0=v_main_~y~0_10, main_~b~0=v_main_~b~0_12, main_~u~0=v_main_~u~0_8, main_~a~0=v_main_~a~0_13} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {380#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-08 01:57:08,483 INFO L290 TraceCheckUtils]: 40: Hoare triple {380#(= |__VERIFIER_assert_#in~cond| 1)} [106] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {384#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 01:57:08,483 INFO L290 TraceCheckUtils]: 41: Hoare triple {384#(<= 1 __VERIFIER_assert_~cond)} [110] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-08 01:57:08,484 INFO L290 TraceCheckUtils]: 42: Hoare triple {258#false} [114] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {258#false} is VALID [2022-04-08 01:57:08,484 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 01:57:08,484 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 01:57:08,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 01:57:08,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711099123] [2022-04-08 01:57:08,485 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 01:57:08,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [645311770] [2022-04-08 01:57:08,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [645311770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 01:57:08,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 01:57:08,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 01:57:08,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16372809] [2022-04-08 01:57:08,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 01:57:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-08 01:57:08,487 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 01:57:08,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 01:57:08,512 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:57:08,512 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 01:57:08,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-08 01:57:08,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 01:57:08,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 01:57:08,514 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 01:57:08,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:57:08,715 INFO L93 Difference]: Finished difference Result 40 states and 49 transitions. [2022-04-08 01:57:08,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 01:57:08,715 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) Word has length 43 [2022-04-08 01:57:08,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 01:57:08,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 01:57:08,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-08 01:57:08,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 01:57:08,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-08 01:57:08,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-08 01:57:08,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 01:57:08,786 INFO L225 Difference]: With dead ends: 40 [2022-04-08 01:57:08,786 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 01:57:08,786 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 01:57:08,787 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 7 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 01:57:08,788 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 105 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 01:57:08,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 01:57:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-08 01:57:08,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 01:57:08,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 01:57:08,798 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 01:57:08,798 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 01:57:08,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:57:08,801 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-08 01:57:08,801 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-08 01:57:08,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:57:08,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:57:08,802 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-08 01:57:08,802 INFO L87 Difference]: Start difference. First operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-08 01:57:08,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 01:57:08,806 INFO L93 Difference]: Finished difference Result 37 states and 45 transitions. [2022-04-08 01:57:08,806 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2022-04-08 01:57:08,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 01:57:08,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 01:57:08,807 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 01:57:08,807 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 01:57:08,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 01:57:08,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-08 01:57:08,810 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 43 [2022-04-08 01:57:08,810 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 01:57:08,810 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-08 01:57:08,810 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (9), 2 states have call predecessors, (9), 1 states have return successors, (7), 1 states have call predecessors, (7), 1 states have call successors, (7) [2022-04-08 01:57:08,811 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 01:57:08,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-08 01:57:08,812 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 01:57:08,812 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 01:57:08,835 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-08 01:57:09,027 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-08 01:57:09,028 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 01:57:09,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 01:57:09,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1282076869, now seen corresponding path program 1 times [2022-04-08 01:57:09,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 01:57:09,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263051024] [2022-04-08 01:57:09,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:57:09,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 01:57:09,052 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 01:57:09,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1930031372] [2022-04-08 01:57:09,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 01:57:09,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 01:57:09,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 01:57:09,063 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-08 01:57:09,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process