/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/lcm1_unwindbound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:44:49,960 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:44:49,963 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:44:49,982 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:44:49,982 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:44:49,983 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:44:49,984 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:44:49,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:44:49,986 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:44:49,986 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:44:49,987 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:44:49,989 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:44:49,989 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:44:49,993 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:44:49,993 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:44:49,994 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:44:49,994 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:44:49,995 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:44:49,996 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:44:49,996 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:44:49,997 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:44:50,001 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:44:50,002 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:44:50,003 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:44:50,004 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:44:50,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:44:50,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:44:50,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:44:50,015 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:44:50,015 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:44:50,015 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:44:50,016 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:44:50,016 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:44:50,016 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:44:50,017 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:44:50,017 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:44:50,017 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:44:50,018 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:44:50,018 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:44:50,018 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:44:50,019 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:44:50,022 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:44:50,023 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-15 03:44:50,045 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:44:50,045 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:44:50,046 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:44:50,046 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:44:50,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:44:50,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:44:50,047 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:44:50,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:44:50,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:44:50,048 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:44:50,048 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:44:50,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:44:50,049 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:44:50,049 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:44:50,049 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:44:50,049 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:44:50,049 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:44:50,049 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:44:50,049 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:44:50,050 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:44:50,051 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:44:50,051 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-15 03:44:50,252 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:44:50,281 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:44:50,283 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:44:50,284 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:44:50,286 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:44:50,287 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound2.c [2022-04-15 03:44:50,330 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1658b64da/40309b9c61434f55869d98c0125bc9d4/FLAGa4564a6bd [2022-04-15 03:44:50,691 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:44:50,691 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/lcm1_unwindbound2.c [2022-04-15 03:44:50,697 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1658b64da/40309b9c61434f55869d98c0125bc9d4/FLAGa4564a6bd [2022-04-15 03:44:50,707 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1658b64da/40309b9c61434f55869d98c0125bc9d4 [2022-04-15 03:44:50,709 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:44:50,711 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:44:50,723 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:44:50,723 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:44:50,726 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:44:50,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:50,727 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27a2b91 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50, skipping insertion in model container [2022-04-15 03:44:50,727 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:50,732 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:44:50,742 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:44:50,902 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/lcm1_unwindbound2.c[552,565] [2022-04-15 03:44:50,933 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:44:50,939 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:44:50,952 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/lcm1_unwindbound2.c[552,565] [2022-04-15 03:44:50,974 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:44:50,989 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:44:50,990 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50 WrapperNode [2022-04-15 03:44:50,991 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:44:50,992 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:44:50,992 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:44:50,992 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:44:51,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,011 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,011 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,025 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,029 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,030 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:44:51,031 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:44:51,032 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:44:51,032 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:44:51,033 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (1/1) ... [2022-04-15 03:44:51,039 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:44:51,046 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:44:51,085 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-15 03:44:51,117 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-15 03:44:51,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:44:51,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:44:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:44:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:44:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:44:51,153 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:44:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:44:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:44:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:44:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:44:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-15 03:44:51,153 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:44:51,154 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:44:51,218 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:44:51,219 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:44:51,385 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:44:51,389 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:44:51,389 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 03:44:51,390 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:44:51 BoogieIcfgContainer [2022-04-15 03:44:51,390 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:44:51,391 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:44:51,391 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:44:51,392 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:44:51,394 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:44:51" (1/1) ... [2022-04-15 03:44:51,396 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:44:51,416 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:44:51 BasicIcfg [2022-04-15 03:44:51,416 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:44:51,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:44:51,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:44:51,418 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:44:51,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:44:50" (1/4) ... [2022-04-15 03:44:51,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afb7e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:44:51, skipping insertion in model container [2022-04-15 03:44:51,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:44:50" (2/4) ... [2022-04-15 03:44:51,419 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afb7e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:44:51, skipping insertion in model container [2022-04-15 03:44:51,419 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:44:51" (3/4) ... [2022-04-15 03:44:51,420 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@afb7e98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:44:51, skipping insertion in model container [2022-04-15 03:44:51,420 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:44:51" (4/4) ... [2022-04-15 03:44:51,420 INFO L111 eAbstractionObserver]: Analyzing ICFG lcm1_unwindbound2.cqvasr [2022-04-15 03:44:51,423 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:44:51,423 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:44:51,456 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:44:51,467 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-15 03:44:51,468 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:44:51,484 INFO L276 IsEmpty]: Start isEmpty. Operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 03:44:51,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-15 03:44:51,487 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:44:51,488 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:44:51,488 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:44:51,492 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:44:51,492 INFO L85 PathProgramCache]: Analyzing trace with hash -615641025, now seen corresponding path program 1 times [2022-04-15 03:44:51,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:44:51,498 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534687828] [2022-04-15 03:44:51,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:44:51,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:44:51,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:51,670 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 03:44:51,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:51,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {64#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [116] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 1)) (.cse0 (select |v_#memory_int_1| 2))) (and (= 49 (select .cse0 3)) (= 48 (select .cse1 0)) (= 108 (select .cse0 0)) (= (select .cse0 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse0 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select .cse0 2) 109) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse1 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse0 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse0 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {43#true} is VALID [2022-04-15 03:44:51,684 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [119] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-15 03:44:51,685 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43#true} {43#true} [160] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-15 03:44:51,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 03:44:51,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:51,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {43#true} [161] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (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_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-15 03:44:51,692 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-04-15 03:44:51,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:51,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,699 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [162] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_11 4294967296)) 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_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-15 03:44:51,699 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2022-04-15 03:44:51,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:51,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,706 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [163] assume_abort_if_notEXIT-->L31: 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_3|) InVars {main_~a~0=v_main_~a~0_12} 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] {44#false} is VALID [2022-04-15 03:44:51,706 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2022-04-15 03:44:51,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:51,733 INFO L290 TraceCheckUtils]: 0: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,734 INFO L290 TraceCheckUtils]: 1: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,734 INFO L290 TraceCheckUtils]: 2: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,735 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44#false} {44#false} [164] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} 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] {44#false} is VALID [2022-04-15 03:44:51,737 INFO L272 TraceCheckUtils]: 0: Hoare triple {43#true} [114] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {64#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 03:44:51,738 INFO L290 TraceCheckUtils]: 1: Hoare triple {64#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [116] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 1)) (.cse0 (select |v_#memory_int_1| 2))) (and (= 49 (select .cse0 3)) (= 48 (select .cse1 0)) (= 108 (select .cse0 0)) (= (select .cse0 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse0 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select .cse0 2) 109) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse1 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse0 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse0 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {43#true} is VALID [2022-04-15 03:44:51,738 INFO L290 TraceCheckUtils]: 2: Hoare triple {43#true} [119] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-15 03:44:51,738 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {43#true} {43#true} [160] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-15 03:44:51,739 INFO L272 TraceCheckUtils]: 4: Hoare triple {43#true} [115] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {43#true} is VALID [2022-04-15 03:44:51,739 INFO L290 TraceCheckUtils]: 5: Hoare triple {43#true} [118] mainENTRY-->L28: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_3, main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {43#true} is VALID [2022-04-15 03:44:51,739 INFO L272 TraceCheckUtils]: 6: Hoare triple {43#true} [120] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (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_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {43#true} is VALID [2022-04-15 03:44:51,739 INFO L290 TraceCheckUtils]: 7: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,743 INFO L290 TraceCheckUtils]: 8: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,744 INFO L290 TraceCheckUtils]: 9: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,744 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44#false} {43#true} [161] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (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_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {44#false} is VALID [2022-04-15 03:44:51,744 INFO L272 TraceCheckUtils]: 11: Hoare triple {44#false} [121] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_11 4294967296)) 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_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {43#true} is VALID [2022-04-15 03:44:51,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,746 INFO L290 TraceCheckUtils]: 14: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,746 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44#false} {44#false} [162] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_11 4294967296)) 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_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {44#false} is VALID [2022-04-15 03:44:51,747 INFO L272 TraceCheckUtils]: 16: Hoare triple {44#false} [123] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~a~0=v_main_~a~0_12} 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] {43#true} is VALID [2022-04-15 03:44:51,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,749 INFO L290 TraceCheckUtils]: 18: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,749 INFO L290 TraceCheckUtils]: 19: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,750 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {44#false} {44#false} [163] assume_abort_if_notEXIT-->L31: 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_3|) InVars {main_~a~0=v_main_~a~0_12} 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] {44#false} is VALID [2022-04-15 03:44:51,750 INFO L272 TraceCheckUtils]: 21: Hoare triple {44#false} [126] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} 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] {43#true} is VALID [2022-04-15 03:44:51,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {43#true} [122] assume_abort_if_notENTRY-->L12: 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] {43#true} is VALID [2022-04-15 03:44:51,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {43#true} [124] L12-->L12-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {44#false} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,754 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {44#false} {44#false} [164] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} 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] {44#false} is VALID [2022-04-15 03:44:51,755 INFO L290 TraceCheckUtils]: 26: Hoare triple {44#false} [128] L32-->L52-3: Formula: (and (= v_main_~b~0_7 v_main_~u~0_5) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~x~0_4) (= v_main_~v~0_4 0)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {44#false} is VALID [2022-04-15 03:44:51,755 INFO L290 TraceCheckUtils]: 27: Hoare triple {44#false} [129] L52-3-->L39-3: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,755 INFO L272 TraceCheckUtils]: 28: Hoare triple {44#false} [131] L39-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (* v_main_~a~0_16 v_main_~b~0_16) 4294967296) (mod (+ (* v_main_~v~0_13 v_main_~y~0_18) (* v_main_~u~0_13 v_main_~y~0_18)) 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~v~0=v_main_~v~0_13, main_~b~0=v_main_~b~0_16, main_~u~0=v_main_~u~0_13, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {44#false} is VALID [2022-04-15 03:44:51,755 INFO L290 TraceCheckUtils]: 29: Hoare triple {44#false} [135] __VERIFIER_assertENTRY-->L15: 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] {44#false} is VALID [2022-04-15 03:44:51,756 INFO L290 TraceCheckUtils]: 30: Hoare triple {44#false} [138] L15-->L16: 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[] {44#false} is VALID [2022-04-15 03:44:51,756 INFO L290 TraceCheckUtils]: 31: Hoare triple {44#false} [143] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {44#false} is VALID [2022-04-15 03:44:51,756 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 03:44:51,757 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:44:51,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534687828] [2022-04-15 03:44:51,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [534687828] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:44:51,757 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:44:51,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 03:44:51,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [192467212] [2022-04-15 03:44:51,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:44:51,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 03:44:51,764 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:44:51,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:51,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:44:51,797 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 03:44:51,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:44:51,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 03:44:51,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 03:44:51,817 INFO L87 Difference]: Start difference. First operand has 40 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 11 states have call successors, (11), 4 states have call predecessors, (11), 4 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:52,038 INFO L93 Difference]: Finished difference Result 74 states and 117 transitions. [2022-04-15 03:44:52,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 03:44:52,039 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2022-04-15 03:44:52,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:44:52,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-04-15 03:44:52,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2022-04-15 03:44:52,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 117 transitions. [2022-04-15 03:44:52,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:44:52,189 INFO L225 Difference]: With dead ends: 74 [2022-04-15 03:44:52,189 INFO L226 Difference]: Without dead ends: 36 [2022-04-15 03:44:52,192 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 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-15 03:44:52,198 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:44:52,200 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 51 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 03:44:52,211 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-04-15 03:44:52,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 35. [2022-04-15 03:44:52,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:44:52,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,230 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,231 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:52,236 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 03:44:52,237 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 03:44:52,237 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:44:52,237 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:44:52,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 36 states. [2022-04-15 03:44:52,239 INFO L87 Difference]: Start difference. First operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 36 states. [2022-04-15 03:44:52,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:52,246 INFO L93 Difference]: Finished difference Result 36 states and 48 transitions. [2022-04-15 03:44:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 48 transitions. [2022-04-15 03:44:52,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:44:52,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:44:52,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:44:52,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:44:52,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 47 transitions. [2022-04-15 03:44:52,250 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 47 transitions. Word has length 32 [2022-04-15 03:44:52,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:44:52,251 INFO L478 AbstractCegarLoop]: Abstraction has 35 states and 47 transitions. [2022-04-15 03:44:52,251 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 2 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,252 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-15 03:44:52,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 03:44:52,253 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:44:52,253 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:44:52,254 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 03:44:52,254 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:44:52,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:44:52,257 INFO L85 PathProgramCache]: Analyzing trace with hash 1244400054, now seen corresponding path program 1 times [2022-04-15 03:44:52,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:44:52,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [765541710] [2022-04-15 03:44:52,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:44:52,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:44:52,302 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:44:52,302 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1057987695] [2022-04-15 03:44:52,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:44:52,302 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:44:52,302 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:44:52,327 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-15 03:44:52,328 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-15 03:44:52,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:52,380 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 03:44:52,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:52,402 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:44:52,616 INFO L272 TraceCheckUtils]: 0: Hoare triple {295#true} [114] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {295#true} is VALID [2022-04-15 03:44:52,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {295#true} [116] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 1)) (.cse0 (select |v_#memory_int_1| 2))) (and (= 49 (select .cse0 3)) (= 48 (select .cse1 0)) (= 108 (select .cse0 0)) (= (select .cse0 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse0 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select .cse0 2) 109) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse1 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse0 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse0 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {303#(<= ~counter~0 0)} [119] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,623 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {303#(<= ~counter~0 0)} {295#true} [160] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,624 INFO L272 TraceCheckUtils]: 4: Hoare triple {303#(<= ~counter~0 0)} [115] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {303#(<= ~counter~0 0)} [118] mainENTRY-->L28: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_3, main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {303#(<= ~counter~0 0)} [120] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (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_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {303#(<= ~counter~0 0)} [122] assume_abort_if_notENTRY-->L12: 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,626 INFO L290 TraceCheckUtils]: 8: Hoare triple {303#(<= ~counter~0 0)} [125] L12-->L12-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[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,626 INFO L290 TraceCheckUtils]: 9: Hoare triple {303#(<= ~counter~0 0)} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,627 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} [161] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (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_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,627 INFO L272 TraceCheckUtils]: 11: Hoare triple {303#(<= ~counter~0 0)} [121] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_11 4294967296)) 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_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {303#(<= ~counter~0 0)} [122] assume_abort_if_notENTRY-->L12: 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {303#(<= ~counter~0 0)} [125] L12-->L12-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[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,628 INFO L290 TraceCheckUtils]: 14: Hoare triple {303#(<= ~counter~0 0)} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,629 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} [162] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_11 4294967296)) 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_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,629 INFO L272 TraceCheckUtils]: 16: Hoare triple {303#(<= ~counter~0 0)} [123] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~a~0=v_main_~a~0_12} 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {303#(<= ~counter~0 0)} [122] assume_abort_if_notENTRY-->L12: 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {303#(<= ~counter~0 0)} [125] L12-->L12-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[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,631 INFO L290 TraceCheckUtils]: 19: Hoare triple {303#(<= ~counter~0 0)} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,631 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} [163] assume_abort_if_notEXIT-->L31: 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_3|) InVars {main_~a~0=v_main_~a~0_12} 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,635 INFO L272 TraceCheckUtils]: 21: Hoare triple {303#(<= ~counter~0 0)} [126] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {303#(<= ~counter~0 0)} [122] assume_abort_if_notENTRY-->L12: 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,637 INFO L290 TraceCheckUtils]: 23: Hoare triple {303#(<= ~counter~0 0)} [125] L12-->L12-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[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,637 INFO L290 TraceCheckUtils]: 24: Hoare triple {303#(<= ~counter~0 0)} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,638 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {303#(<= ~counter~0 0)} {303#(<= ~counter~0 0)} [164] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} 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] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,640 INFO L290 TraceCheckUtils]: 26: Hoare triple {303#(<= ~counter~0 0)} [128] L32-->L52-3: Formula: (and (= v_main_~b~0_7 v_main_~u~0_5) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~x~0_4) (= v_main_~v~0_4 0)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {303#(<= ~counter~0 0)} is VALID [2022-04-15 03:44:52,640 INFO L290 TraceCheckUtils]: 27: Hoare triple {303#(<= ~counter~0 0)} [130] L52-3-->L39-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {382#(<= |main_#t~post6| 0)} is VALID [2022-04-15 03:44:52,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {382#(<= |main_#t~post6| 0)} [132] L39-1-->L39-3: Formula: (not (< |v_main_#t~post6_3| 2)) InVars {main_#t~post6=|v_main_#t~post6_3|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {296#false} is VALID [2022-04-15 03:44:52,642 INFO L272 TraceCheckUtils]: 29: Hoare triple {296#false} [131] L39-3-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_4| (ite (= (mod (* v_main_~a~0_16 v_main_~b~0_16) 4294967296) (mod (+ (* v_main_~v~0_13 v_main_~y~0_18) (* v_main_~u~0_13 v_main_~y~0_18)) 4294967296)) 1 0)) InVars {main_~y~0=v_main_~y~0_18, main_~v~0=v_main_~v~0_13, main_~b~0=v_main_~b~0_16, main_~u~0=v_main_~u~0_13, main_~a~0=v_main_~a~0_16} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_4|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {296#false} is VALID [2022-04-15 03:44:52,642 INFO L290 TraceCheckUtils]: 30: Hoare triple {296#false} [135] __VERIFIER_assertENTRY-->L15: 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] {296#false} is VALID [2022-04-15 03:44:52,642 INFO L290 TraceCheckUtils]: 31: Hoare triple {296#false} [138] L15-->L16: 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[] {296#false} is VALID [2022-04-15 03:44:52,643 INFO L290 TraceCheckUtils]: 32: Hoare triple {296#false} [143] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {296#false} is VALID [2022-04-15 03:44:52,643 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 03:44:52,644 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:44:52,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:44:52,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [765541710] [2022-04-15 03:44:52,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:44:52,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1057987695] [2022-04-15 03:44:52,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1057987695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:44:52,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:44:52,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 03:44:52,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237685250] [2022-04-15 03:44:52,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:44:52,650 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 03:44:52,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:44:52,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:44:52,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 03:44:52,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:44:52,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 03:44:52,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:44:52,672 INFO L87 Difference]: Start difference. First operand 35 states and 47 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:52,764 INFO L93 Difference]: Finished difference Result 45 states and 58 transitions. [2022-04-15 03:44:52,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 03:44:52,765 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) Word has length 33 [2022-04-15 03:44:52,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:44:52,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 03:44:52,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 58 transitions. [2022-04-15 03:44:52,768 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 58 transitions. [2022-04-15 03:44:52,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:44:52,810 INFO L225 Difference]: With dead ends: 45 [2022-04-15 03:44:52,810 INFO L226 Difference]: Without dead ends: 37 [2022-04-15 03:44:52,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 03:44:52,811 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 0 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:44:52,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:44:52,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-15 03:44:52,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2022-04-15 03:44:52,819 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:44:52,820 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,820 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,820 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:52,822 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-15 03:44:52,822 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-15 03:44:52,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:44:52,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:44:52,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-15 03:44:52,823 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 37 states. [2022-04-15 03:44:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:52,825 INFO L93 Difference]: Finished difference Result 37 states and 49 transitions. [2022-04-15 03:44:52,825 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-15 03:44:52,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:44:52,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:44:52,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:44:52,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:44:52,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 11 states have call successors, (11), 4 states have call predecessors, (11), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 03:44:52,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 49 transitions. [2022-04-15 03:44:52,827 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 49 transitions. Word has length 33 [2022-04-15 03:44:52,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:44:52,827 INFO L478 AbstractCegarLoop]: Abstraction has 37 states and 49 transitions. [2022-04-15 03:44:52,828 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (7), 3 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 2 states have call successors, (5) [2022-04-15 03:44:52,828 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 49 transitions. [2022-04-15 03:44:52,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 03:44:52,828 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:44:52,828 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 03:44:52,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 03:44:53,046 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-15 03:44:53,047 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:44:53,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:44:53,049 INFO L85 PathProgramCache]: Analyzing trace with hash 1245472530, now seen corresponding path program 1 times [2022-04-15 03:44:53,049 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:44:53,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610537994] [2022-04-15 03:44:53,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:44:53,049 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:44:53,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:44:53,097 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [678347812] [2022-04-15 03:44:53,105 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:44:53,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:44:53,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:44:53,106 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-15 03:44:53,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-15 03:44:53,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:53,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 03:44:53,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:44:53,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:44:53,290 INFO L272 TraceCheckUtils]: 0: Hoare triple {592#true} [114] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {592#true} [116] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse1 (select |v_#memory_int_1| 1)) (.cse0 (select |v_#memory_int_1| 2))) (and (= 49 (select .cse0 3)) (= 48 (select .cse1 0)) (= 108 (select .cse0 0)) (= (select .cse0 1) 99) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (= (select .cse0 6) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 3) 12) (= v_~counter~0_7 0) (= (select .cse0 2) 109) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse1 1) 0) (= |v_#NULL.offset_1| 0) (= 99 (select .cse0 5)) (= 7 (select |v_#length_1| 2)) (= (select .cse0 4) 46))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{~counter~0=v_~counter~0_7, #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[~counter~0, #NULL.offset, #NULL.base] {592#true} is VALID [2022-04-15 03:44:53,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {592#true} [119] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {592#true} {592#true} [160] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {592#true} [115] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {592#true} [118] mainENTRY-->L28: Formula: (and (= v_main_~a~0_2 |v_main_#t~nondet4_2|) (= v_main_~b~0_2 |v_main_#t~nondet5_2|)) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|, main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_3, main_~x~0=v_main_~x~0_3, main_~y~0=v_main_~y~0_5, main_~b~0=v_main_~b~0_2, main_~u~0=v_main_~u~0_4, main_~a~0=v_main_~a~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_#t~nondet4, main_~v~0, main_~x~0, main_~y~0, main_~b~0, main_~u~0, main_~a~0] {592#true} is VALID [2022-04-15 03:44:53,291 INFO L272 TraceCheckUtils]: 6: Hoare triple {592#true} [120] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (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_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {592#true} is VALID [2022-04-15 03:44:53,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {592#true} [122] assume_abort_if_notENTRY-->L12: 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] {592#true} is VALID [2022-04-15 03:44:53,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {592#true} [125] L12-->L12-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[] {592#true} is VALID [2022-04-15 03:44:53,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {592#true} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,292 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {592#true} {592#true} [161] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (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_1|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~a~0] {592#true} is VALID [2022-04-15 03:44:53,292 INFO L272 TraceCheckUtils]: 11: Hoare triple {592#true} [121] L28-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_11 4294967296)) 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_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {592#true} is VALID [2022-04-15 03:44:53,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {592#true} [122] assume_abort_if_notENTRY-->L12: 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] {592#true} is VALID [2022-04-15 03:44:53,292 INFO L290 TraceCheckUtils]: 13: Hoare triple {592#true} [125] L12-->L12-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[] {592#true} is VALID [2022-04-15 03:44:53,292 INFO L290 TraceCheckUtils]: 14: Hoare triple {592#true} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,293 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {592#true} {592#true} [162] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= 1 (mod v_main_~b~0_11 4294967296)) 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_2|} AuxVars[] AssignedVars[main_~b~0, assume_abort_if_not_#in~cond] {592#true} is VALID [2022-04-15 03:44:53,293 INFO L272 TraceCheckUtils]: 16: Hoare triple {592#true} [123] L29-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~a~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_3|) InVars {main_~a~0=v_main_~a~0_12} 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] {592#true} is VALID [2022-04-15 03:44:53,293 INFO L290 TraceCheckUtils]: 17: Hoare triple {592#true} [122] assume_abort_if_notENTRY-->L12: 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] {592#true} is VALID [2022-04-15 03:44:53,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {592#true} [125] L12-->L12-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[] {592#true} is VALID [2022-04-15 03:44:53,293 INFO L290 TraceCheckUtils]: 19: Hoare triple {592#true} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,293 INFO L284 TraceCheckUtils]: 20: Hoare quadruple {592#true} {592#true} [163] assume_abort_if_notEXIT-->L31: 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_3|) InVars {main_~a~0=v_main_~a~0_12} 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] {592#true} is VALID [2022-04-15 03:44:53,293 INFO L272 TraceCheckUtils]: 21: Hoare triple {592#true} [126] L31-->assume_abort_if_notENTRY: Formula: (= (ite (<= (mod v_main_~b~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} 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] {592#true} is VALID [2022-04-15 03:44:53,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {592#true} [122] assume_abort_if_notENTRY-->L12: 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] {592#true} is VALID [2022-04-15 03:44:53,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {592#true} [125] L12-->L12-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[] {592#true} is VALID [2022-04-15 03:44:53,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {592#true} [127] L12-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {592#true} is VALID [2022-04-15 03:44:53,294 INFO L284 TraceCheckUtils]: 25: Hoare quadruple {592#true} {592#true} [164] assume_abort_if_notEXIT-->L32: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= (ite (<= (mod v_main_~b~0_12 4294967296) 65535) 1 0) |v_assume_abort_if_not_#in~condInParam_4|) InVars {main_~b~0=v_main_~b~0_12} 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] {592#true} is VALID [2022-04-15 03:44:53,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {592#true} [128] L32-->L52-3: Formula: (and (= v_main_~b~0_7 v_main_~u~0_5) (= v_main_~b~0_7 v_main_~y~0_6) (= v_main_~a~0_7 v_main_~x~0_4) (= v_main_~v~0_4 0)) InVars {main_~b~0=v_main_~b~0_7, main_~a~0=v_main_~a~0_7} OutVars{main_~v~0=v_main_~v~0_4, main_~x~0=v_main_~x~0_4, main_~y~0=v_main_~y~0_6, main_~b~0=v_main_~b~0_7, main_~u~0=v_main_~u~0_5, main_~a~0=v_main_~a~0_7} AuxVars[] AssignedVars[main_~v~0, main_~x~0, main_~y~0, main_~u~0] {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 03:44:53,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [130] L52-3-->L39-1: Formula: (and (= |v_main_#t~post6_1| v_~counter~0_2) (= v_~counter~0_1 (+ |v_main_#t~post6_1| 1))) InVars {~counter~0=v_~counter~0_2} OutVars{~counter~0=v_~counter~0_1, main_#t~post6=|v_main_#t~post6_1|} AuxVars[] AssignedVars[~counter~0, main_#t~post6] {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 03:44:53,297 INFO L290 TraceCheckUtils]: 28: Hoare triple {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [133] L39-1-->L40: Formula: (< |v_main_#t~post6_5| 2) InVars {main_#t~post6=|v_main_#t~post6_5|} OutVars{} AuxVars[] AssignedVars[main_#t~post6] {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} is VALID [2022-04-15 03:44:53,298 INFO L272 TraceCheckUtils]: 29: Hoare triple {675#(and (= main_~v~0 0) (= main_~b~0 main_~u~0) (= main_~a~0 main_~x~0))} [136] L40-->__VERIFIER_assertENTRY: Formula: (= |v___VERIFIER_assert_#in~condInParam_1| (ite (= (mod (* v_main_~a~0_13 v_main_~b~0_13) 4294967296) (mod (+ (* v_main_~v~0_10 v_main_~y~0_15) (* v_main_~u~0_10 v_main_~x~0_14)) 4294967296)) 1 0)) InVars {main_~v~0=v_main_~v~0_10, main_~x~0=v_main_~x~0_14, main_~y~0=v_main_~y~0_15, main_~b~0=v_main_~b~0_13, main_~u~0=v_main_~u~0_10, 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] {685#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:44:53,298 INFO L290 TraceCheckUtils]: 30: Hoare triple {685#(<= 1 |__VERIFIER_assert_#in~cond|)} [135] __VERIFIER_assertENTRY-->L15: 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] {689#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:44:53,299 INFO L290 TraceCheckUtils]: 31: Hoare triple {689#(<= 1 __VERIFIER_assert_~cond)} [138] L15-->L16: 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[] {593#false} is VALID [2022-04-15 03:44:53,299 INFO L290 TraceCheckUtils]: 32: Hoare triple {593#false} [143] L16-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {593#false} is VALID [2022-04-15 03:44:53,300 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-15 03:44:53,300 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:44:53,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:44:53,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610537994] [2022-04-15 03:44:53,300 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:44:53,300 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678347812] [2022-04-15 03:44:53,300 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678347812] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:44:53,300 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:44:53,300 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 03:44:53,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751375766] [2022-04-15 03:44:53,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:44:53,301 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 03:44:53,301 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:44:53,301 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:44:53,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:44:53,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 03:44:53,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:44:53,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 03:44:53,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 03:44:53,318 INFO L87 Difference]: Start difference. First operand 37 states and 49 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:44:53,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:53,531 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-04-15 03:44:53,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 03:44:53,531 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) Word has length 33 [2022-04-15 03:44:53,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:44:53,532 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:44:53,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-04-15 03:44:53,533 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:44:53,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 76 transitions. [2022-04-15 03:44:53,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 76 transitions. [2022-04-15 03:44:53,619 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:44:53,620 INFO L225 Difference]: With dead ends: 57 [2022-04-15 03:44:53,620 INFO L226 Difference]: Without dead ends: 55 [2022-04-15 03:44:53,621 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 29 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-15 03:44:53,621 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 16 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 03:44:53,622 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [20 Valid, 138 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 03:44:53,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-04-15 03:44:53,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-04-15 03:44:53,640 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:44:53,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 03:44:53,641 INFO L74 IsIncluded]: Start isIncluded. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 03:44:53,641 INFO L87 Difference]: Start difference. First operand 55 states. Second operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 03:44:53,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:53,643 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-15 03:44:53,643 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-04-15 03:44:53,644 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:44:53,644 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:44:53,644 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-15 03:44:53,644 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 55 states. [2022-04-15 03:44:53,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:44:53,646 INFO L93 Difference]: Finished difference Result 55 states and 76 transitions. [2022-04-15 03:44:53,646 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 76 transitions. [2022-04-15 03:44:53,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:44:53,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:44:53,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:44:53,647 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:44:53,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 14 states have call successors, (14), 5 states have call predecessors, (14), 4 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-15 03:44:53,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 73 transitions. [2022-04-15 03:44:53,649 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 73 transitions. Word has length 33 [2022-04-15 03:44:53,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:44:53,649 INFO L478 AbstractCegarLoop]: Abstraction has 53 states and 73 transitions. [2022-04-15 03:44:53,649 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, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 1 states have call predecessors, (5), 1 states have call successors, (5) [2022-04-15 03:44:53,649 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 73 transitions. [2022-04-15 03:44:53,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-04-15 03:44:53,650 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:44:53,650 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 4, 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] [2022-04-15 03:44:53,682 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-15 03:44:53,879 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-04-15 03:44:53,879 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:44:53,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:44:53,880 INFO L85 PathProgramCache]: Analyzing trace with hash -64495806, now seen corresponding path program 1 times [2022-04-15 03:44:53,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:44:53,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [508344319] [2022-04-15 03:44:53,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:44:53,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:44:53,899 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:44:53,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1309285400] [2022-04-15 03:44:53,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:44:53,900 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:44:53,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:44:53,906 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 03:44:53,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process