/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/geo1-u_valuebound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 00:12:18,934 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 00:12:18,944 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 00:12:18,986 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 00:12:18,986 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 00:12:18,987 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 00:12:18,988 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 00:12:18,990 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 00:12:18,991 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 00:12:18,992 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 00:12:18,993 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 00:12:18,993 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 00:12:18,994 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 00:12:18,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 00:12:18,997 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 00:12:19,000 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 00:12:19,001 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 00:12:19,008 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 00:12:19,015 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 00:12:19,021 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 00:12:19,024 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 00:12:19,026 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 00:12:19,027 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 00:12:19,029 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 00:12:19,031 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 00:12:19,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 00:12:19,037 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 00:12:19,037 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 00:12:19,038 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 00:12:19,038 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 00:12:19,039 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 00:12:19,039 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 00:12:19,040 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 00:12:19,040 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 00:12:19,041 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 00:12:19,041 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 00:12:19,041 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 00:12:19,042 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 00:12:19,042 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 00:12:19,042 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 00:12:19,043 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 00:12:19,048 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 00:12:19,049 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/loopacceleration/qvasr/qvasr_64.epf [2022-04-28 00:12:19,076 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 00:12:19,077 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 00:12:19,078 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-28 00:12:19,078 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-28 00:12:19,079 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-28 00:12:19,079 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-28 00:12:19,079 INFO L138 SettingsManager]: * Use SBE=true [2022-04-28 00:12:19,079 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 00:12:19,079 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 00:12:19,080 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 00:12:19,080 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 00:12:19,081 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 00:12:19,081 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 00:12:19,081 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 00:12:19,081 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 00:12:19,081 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 00:12:19,081 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 00:12:19,081 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 00:12:19,081 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 00:12:19,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:12:19,082 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 00:12:19,082 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-28 00:12:19,082 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-28 00:12:19,082 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-28 00:12:19,082 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-28 00:12:19,082 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 00:12:19,082 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-28 00:12:19,083 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-28 00:12:19,084 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-28 00:12:19,084 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-28 00:12:19,296 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 00:12:19,323 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 00:12:19,325 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 00:12:19,326 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 00:12:19,327 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 00:12:19,328 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound5.c [2022-04-28 00:12:19,388 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f66f9d9/e83b25e1a1b14bad9fb4fe99932d227c/FLAGdb2c28716 [2022-04-28 00:12:19,817 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 00:12:19,818 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_valuebound5.c [2022-04-28 00:12:19,824 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f66f9d9/e83b25e1a1b14bad9fb4fe99932d227c/FLAGdb2c28716 [2022-04-28 00:12:20,231 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/09f66f9d9/e83b25e1a1b14bad9fb4fe99932d227c [2022-04-28 00:12:20,234 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 00:12:20,235 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-28 00:12:20,237 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 00:12:20,237 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 00:12:20,240 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 00:12:20,241 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,242 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@619d77b3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20, skipping insertion in model container [2022-04-28 00:12:20,243 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,252 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 00:12:20,266 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 00:12:20,406 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/geo1-u_valuebound5.c[555,568] [2022-04-28 00:12:20,423 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:12:20,431 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 00:12:20,442 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/geo1-u_valuebound5.c[555,568] [2022-04-28 00:12:20,448 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 00:12:20,459 INFO L208 MainTranslator]: Completed translation [2022-04-28 00:12:20,460 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20 WrapperNode [2022-04-28 00:12:20,460 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 00:12:20,461 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 00:12:20,461 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 00:12:20,462 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 00:12:20,470 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,471 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,476 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,476 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,481 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,484 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,484 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,486 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 00:12:20,487 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 00:12:20,487 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 00:12:20,487 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 00:12:20,488 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,496 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 00:12:20,506 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:12:20,516 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-28 00:12:20,521 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-28 00:12:20,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 00:12:20,542 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 00:12:20,543 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 00:12:20,543 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 00:12:20,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 00:12:20,543 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 00:12:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 00:12:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 00:12:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 00:12:20,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 00:12:20,544 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 00:12:20,596 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 00:12:20,597 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 00:12:20,772 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 00:12:20,782 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 00:12:20,782 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 00:12:20,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:12:20 BoogieIcfgContainer [2022-04-28 00:12:20,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 00:12:20,785 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-28 00:12:20,785 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-28 00:12:20,786 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-28 00:12:20,793 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:12:20" (1/1) ... [2022-04-28 00:12:20,795 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-28 00:12:20,834 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:12:20 BasicIcfg [2022-04-28 00:12:20,834 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-28 00:12:20,836 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 00:12:20,836 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 00:12:20,849 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 00:12:20,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 12:12:20" (1/4) ... [2022-04-28 00:12:20,850 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109a0a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:12:20, skipping insertion in model container [2022-04-28 00:12:20,850 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 12:12:20" (2/4) ... [2022-04-28 00:12:20,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109a0a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 12:12:20, skipping insertion in model container [2022-04-28 00:12:20,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 12:12:20" (3/4) ... [2022-04-28 00:12:20,851 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@109a0a45 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:12:20, skipping insertion in model container [2022-04-28 00:12:20,851 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 28.04 12:12:20" (4/4) ... [2022-04-28 00:12:20,852 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound5.cqvasr [2022-04-28 00:12:20,871 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-28 00:12:20,871 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 00:12:20,931 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 00:12:20,939 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4e110361, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@5af12402 [2022-04-28 00:12:20,939 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 00:12:20,946 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 00:12:20,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 00:12:20,952 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:12:20,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:12:20,953 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:12:20,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:12:20,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1045869758, now seen corresponding path program 1 times [2022-04-28 00:12:20,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:12:20,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924614610] [2022-04-28 00:12:20,967 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:20,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:12:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:21,138 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 00:12:21,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:21,158 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-28 00:12:21,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 00:12:21,159 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 00:12:21,160 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-28 00:12:21,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:21,167 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 00:12:21,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [78] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} [96] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~z~0_9 4294967296) 5) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 00:12:21,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-28 00:12:21,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:21,177 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 00:12:21,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} [78] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,178 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {34#false} [97] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~k~0_6 4294967296) 5) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 00:12:21,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {46#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 00:12:21,180 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {33#true} is VALID [2022-04-28 00:12:21,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 00:12:21,181 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 00:12:21,181 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {33#true} is VALID [2022-04-28 00:12:21,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} [69] mainENTRY-->L26: Formula: (= v_main_~z~0_2 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {33#true} is VALID [2022-04-28 00:12:21,182 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} [71] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~z~0_9 4294967296) 5) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-28 00:12:21,182 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 00:12:21,183 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,183 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} [78] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,183 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} [96] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~z~0_9 4294967296) 5) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 00:12:21,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} [72] L26-1-->L28: Formula: (= v_main_~k~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {34#false} is VALID [2022-04-28 00:12:21,184 INFO L272 TraceCheckUtils]: 12: Hoare triple {34#false} [74] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~k~0_6 4294967296) 5) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {33#true} is VALID [2022-04-28 00:12:21,184 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} [73] assume_abort_if_notENTRY-->L13: 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] {33#true} is VALID [2022-04-28 00:12:21,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {33#true} [75] L13-->L13-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,185 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} [78] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,185 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {34#false} {34#false} [97] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~k~0_6 4294967296) 5) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {34#false} is VALID [2022-04-28 00:12:21,186 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} [77] L28-1-->L34-2: Formula: (and (= v_main_~c~0_2 1) (= v_main_~x~0_5 1) (= v_main_~y~0_3 (mod v_main_~z~0_6 4294967296))) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {34#false} is VALID [2022-04-28 00:12:21,186 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} [81] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,186 INFO L272 TraceCheckUtils]: 19: Hoare triple {34#false} [83] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (mod v_main_~z~0_10 4294967296) v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {34#false} is VALID [2022-04-28 00:12:21,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} [87] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {34#false} is VALID [2022-04-28 00:12:21,187 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} [89] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,187 INFO L290 TraceCheckUtils]: 22: Hoare triple {34#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {34#false} is VALID [2022-04-28 00:12:21,188 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 00:12:21,188 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:12:21,188 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924614610] [2022-04-28 00:12:21,189 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924614610] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:12:21,189 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:12:21,189 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-28 00:12:21,190 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1070683853] [2022-04-28 00:12:21,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:12:21,196 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 00:12:21,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:12:21,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:12:21,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:21,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-28 00:12:21,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:12:21,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-28 00:12:21,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 00:12:21,247 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 19 states have internal predecessors, (24), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:12:21,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:21,394 INFO L93 Difference]: Finished difference Result 53 states and 68 transitions. [2022-04-28 00:12:21,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-28 00:12:21,395 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 00:12:21,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:12:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:12:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-28 00:12:21,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:12:21,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-04-28 00:12:21,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-04-28 00:12:21,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:21,528 INFO L225 Difference]: With dead ends: 53 [2022-04-28 00:12:21,528 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 00:12:21,531 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-28 00:12:21,535 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 17 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:12:21,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 31 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:12:21,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 00:12:21,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 00:12:21,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:12:21,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 00:12:21,582 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 00:12:21,582 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 00:12:21,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:21,587 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 00:12:21,587 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 00:12:21,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:21,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:21,589 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 00:12:21,590 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 25 states. [2022-04-28 00:12:21,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:21,594 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-28 00:12:21,594 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 00:12:21,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:21,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:21,595 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:12:21,595 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:12:21,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-28 00:12:21,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-28 00:12:21,600 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 23 [2022-04-28 00:12:21,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:12:21,600 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-28 00:12:21,601 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 00:12:21,601 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-28 00:12:21,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 00:12:21,602 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:12:21,602 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:12:21,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 00:12:21,602 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:12:21,603 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:12:21,603 INFO L85 PathProgramCache]: Analyzing trace with hash 745967104, now seen corresponding path program 1 times [2022-04-28 00:12:21,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:12:21,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1021878249] [2022-04-28 00:12:21,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:21,604 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:12:21,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:12:21,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [382616507] [2022-04-28 00:12:21,645 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:21,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:12:21,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:12:21,647 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-28 00:12:21,648 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-28 00:12:21,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:21,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 00:12:21,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 00:12:21,722 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 00:12:21,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {205#true} [65] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#true} is VALID [2022-04-28 00:12:21,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {205#true} [67] ULTIMATE.initENTRY-->ULTIMATE.initFINAL: Formula: (let ((.cse0 (select |v_#memory_int_1| 1))) (and (= 48 (select .cse0 0)) (= (select |v_#valid_1| 2) 1) (= (select |v_#valid_1| 0) 0) (< 0 |v_#StackHeapBarrier_1|) (= |v_#NULL.base_1| 0) (= 1 (select |v_#valid_1| 3)) (= (select |v_#length_1| 2) 9) (= (select |v_#length_1| 3) 12) (= (select |v_#valid_1| 1) 1) (= 2 (select |v_#length_1| 1)) (= (select .cse0 1) 0) (= |v_#NULL.offset_1| 0))) InVars {#memory_int=|v_#memory_int_1|, #StackHeapBarrier=|v_#StackHeapBarrier_1|, #length=|v_#length_1|, #valid=|v_#valid_1|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_1|, #valid=|v_#valid_1|, #memory_int=|v_#memory_int_1|, #NULL.offset=|v_#NULL.offset_1|, #length=|v_#length_1|, #NULL.base=|v_#NULL.base_1|} AuxVars[] AssignedVars[#NULL.offset, #NULL.base] {205#true} is VALID [2022-04-28 00:12:21,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {205#true} [70] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#true} is VALID [2022-04-28 00:12:21,911 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {205#true} {205#true} [95] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#true} is VALID [2022-04-28 00:12:21,912 INFO L272 TraceCheckUtils]: 4: Hoare triple {205#true} [66] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#true} is VALID [2022-04-28 00:12:21,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {205#true} [69] mainENTRY-->L26: Formula: (= v_main_~z~0_2 |v_main_#t~nondet4_2|) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~c~0=v_main_~c~0_1, main_~y~0=v_main_~y~0_2, main_~x~0=v_main_~x~0_4, main_~z~0=v_main_~z~0_2, main_~k~0=v_main_~k~0_1} AuxVars[] AssignedVars[main_#t~nondet4, main_~x~0, main_~z~0, main_~k~0, main_~c~0, main_~y~0] {205#true} is VALID [2022-04-28 00:12:21,912 INFO L272 TraceCheckUtils]: 6: Hoare triple {205#true} [71] L26-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~z~0_9 4294967296) 5) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {205#true} is VALID [2022-04-28 00:12:21,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {205#true} [73] assume_abort_if_notENTRY-->L13: 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] {205#true} is VALID [2022-04-28 00:12:21,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {205#true} [76] L13-->L13-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[] {205#true} is VALID [2022-04-28 00:12:21,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {205#true} [78] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#true} is VALID [2022-04-28 00:12:21,914 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {205#true} {205#true} [96] assume_abort_if_notEXIT-->L26-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (<= (mod v_main_~z~0_9 4294967296) 5) 1 0)) InVars {main_~z~0=v_main_~z~0_9} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~z~0, assume_abort_if_not_#in~cond] {205#true} is VALID [2022-04-28 00:12:21,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {205#true} [72] L26-1-->L28: Formula: (= v_main_~k~0_2 |v_main_#t~nondet5_2|) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~k~0=v_main_~k~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~k~0] {205#true} is VALID [2022-04-28 00:12:21,914 INFO L272 TraceCheckUtils]: 12: Hoare triple {205#true} [74] L28-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~k~0_6 4294967296) 5) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {205#true} is VALID [2022-04-28 00:12:21,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {205#true} [73] assume_abort_if_notENTRY-->L13: 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] {205#true} is VALID [2022-04-28 00:12:21,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {205#true} [76] L13-->L13-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[] {205#true} is VALID [2022-04-28 00:12:21,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {205#true} [78] L13-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {205#true} is VALID [2022-04-28 00:12:21,919 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {205#true} {205#true} [97] assume_abort_if_notEXIT-->L28-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (<= (mod v_main_~k~0_6 4294967296) 5) 1 0)) InVars {main_~k~0=v_main_~k~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[main_~k~0, assume_abort_if_not_#in~cond] {205#true} is VALID [2022-04-28 00:12:21,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {205#true} [77] L28-1-->L34-2: Formula: (and (= v_main_~c~0_2 1) (= v_main_~x~0_5 1) (= v_main_~y~0_3 (mod v_main_~z~0_6 4294967296))) InVars {main_~z~0=v_main_~z~0_6} OutVars{main_~c~0=v_main_~c~0_2, main_~y~0=v_main_~y~0_3, main_~x~0=v_main_~x~0_5, main_~z~0=v_main_~z~0_6} AuxVars[] AssignedVars[main_~x~0, main_~c~0, main_~y~0] {261#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 00:12:21,921 INFO L290 TraceCheckUtils]: 18: Hoare triple {261#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} [81] L34-2-->L35: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-28 00:12:21,922 INFO L272 TraceCheckUtils]: 19: Hoare triple {261#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} [83] L35-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (mod v_main_~z~0_10 4294967296) v_main_~x~0_9) (* (- 1) v_main_~x~0_9) (* (- 1) v_main_~y~0_7) 1) 0) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~y~0=v_main_~y~0_7, main_~x~0=v_main_~x~0_9, main_~z~0=v_main_~z~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~x~0, main_~z~0, main_~y~0] {268#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 00:12:21,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {268#(<= 1 |__VERIFIER_assert_#in~cond|)} [87] __VERIFIER_assertENTRY-->L16: Formula: (= v___VERIFIER_assert_~cond_2 |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_2} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {272#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 00:12:21,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {272#(<= 1 __VERIFIER_assert_~cond)} [89] L16-->L17: Formula: (= v___VERIFIER_assert_~cond_3 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_3} AuxVars[] AssignedVars[] {206#false} is VALID [2022-04-28 00:12:21,926 INFO L290 TraceCheckUtils]: 22: Hoare triple {206#false} [92] L17-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {206#false} is VALID [2022-04-28 00:12:21,926 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 00:12:21,926 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 00:12:21,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 00:12:21,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1021878249] [2022-04-28 00:12:21,927 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 00:12:21,930 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [382616507] [2022-04-28 00:12:21,931 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [382616507] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 00:12:21,931 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 00:12:21,931 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 00:12:21,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070829314] [2022-04-28 00:12:21,933 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 00:12:21,935 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 00:12:21,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 00:12:21,937 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 00:12:21,963 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:21,963 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 00:12:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-28 00:12:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 00:12:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 00:12:21,964 INFO L87 Difference]: Start difference. First operand 25 states and 27 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 00:12:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:22,114 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2022-04-28 00:12:22,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 00:12:22,114 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 00:12:22,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 00:12:22,115 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 00:12:22,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 00:12:22,119 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 00:12:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-28 00:12:22,122 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-28 00:12:22,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 00:12:22,158 INFO L225 Difference]: With dead ends: 35 [2022-04-28 00:12:22,158 INFO L226 Difference]: Without dead ends: 33 [2022-04-28 00:12:22,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 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-28 00:12:22,160 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 6 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 00:12:22,160 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 84 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 00:12:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-28 00:12:22,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2022-04-28 00:12:22,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 00:12:22,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 00:12:22,172 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 00:12:22,173 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 00:12:22,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:22,178 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 00:12:22,178 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 00:12:22,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:22,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:22,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-28 00:12:22,182 INFO L87 Difference]: Start difference. First operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 33 states. [2022-04-28 00:12:22,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 00:12:22,185 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-28 00:12:22,185 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-28 00:12:22,187 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 00:12:22,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 00:12:22,190 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 00:12:22,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 00:12:22,193 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 19 states have (on average 1.105263157894737) internal successors, (21), 21 states have internal predecessors, (21), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 00:12:22,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2022-04-28 00:12:22,199 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 23 [2022-04-28 00:12:22,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 00:12:22,199 INFO L495 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2022-04-28 00:12:22,200 INFO L496 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 00:12:22,200 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2022-04-28 00:12:22,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-28 00:12:22,201 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 00:12:22,202 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 00:12:22,230 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-28 00:12:22,415 WARN L477 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-28 00:12:22,416 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 00:12:22,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 00:12:22,416 INFO L85 PathProgramCache]: Analyzing trace with hash 1484020197, now seen corresponding path program 1 times [2022-04-28 00:12:22,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 00:12:22,417 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1205282793] [2022-04-28 00:12:22,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:22,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 00:12:22,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 00:12:22,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1815607661] [2022-04-28 00:12:22,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 00:12:22,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 00:12:22,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 00:12:22,457 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-28 00:12:22,519 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-28 00:12:22,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:12:22,564 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 00:12:22,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 00:12:22,617 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 00:12:22,617 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 00:12:22,618 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 00:12:22,651 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-28 00:12:22,825 WARN L477 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-28 00:12:22,843 INFO L356 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-04-28 00:12:22,846 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 00:12:22,897 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 00:12:22,898 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L28-1 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L48-1 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L34-2 has no Hoare annotation [2022-04-28 00:12:22,899 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 00:12:22,900 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 00:12:22,900 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 00:12:22,900 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 00:12:22,900 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 00:12:22,900 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 00:12:22,900 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 00:12:22,900 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 12:12:22 BasicIcfg [2022-04-28 00:12:22,900 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 00:12:22,902 INFO L158 Benchmark]: Toolchain (without parser) took 2666.86ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 129.1MB in the beginning and 169.5MB in the end (delta: -40.4MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 00:12:22,902 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 183.5MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 00:12:22,915 INFO L158 Benchmark]: CACSL2BoogieTranslator took 223.36ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 129.0MB in the beginning and 192.4MB in the end (delta: -63.5MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. [2022-04-28 00:12:22,916 INFO L158 Benchmark]: Boogie Preprocessor took 24.64ms. Allocated memory is still 220.2MB. Free memory was 192.4MB in the beginning and 190.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 00:12:22,916 INFO L158 Benchmark]: RCFGBuilder took 297.68ms. Allocated memory is still 220.2MB. Free memory was 190.9MB in the beginning and 179.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 00:12:22,916 INFO L158 Benchmark]: IcfgTransformer took 49.18ms. Allocated memory is still 220.2MB. Free memory was 179.8MB in the beginning and 178.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-28 00:12:22,917 INFO L158 Benchmark]: TraceAbstraction took 2064.75ms. Allocated memory is still 220.2MB. Free memory was 177.8MB in the beginning and 169.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. [2022-04-28 00:12:22,918 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 183.5MB. Free memory is still 145.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 223.36ms. Allocated memory was 183.5MB in the beginning and 220.2MB in the end (delta: 36.7MB). Free memory was 129.0MB in the beginning and 192.4MB in the end (delta: -63.5MB). Peak memory consumption was 8.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 24.64ms. Allocated memory is still 220.2MB. Free memory was 192.4MB in the beginning and 190.9MB in the end (delta: 1.6MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 297.68ms. Allocated memory is still 220.2MB. Free memory was 190.9MB in the beginning and 179.8MB in the end (delta: 11.0MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * IcfgTransformer took 49.18ms. Allocated memory is still 220.2MB. Free memory was 179.8MB in the beginning and 178.3MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * TraceAbstraction took 2064.75ms. Allocated memory is still 220.2MB. Free memory was 177.8MB in the beginning and 169.5MB in the end (delta: 8.3MB). Peak memory consumption was 8.7MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L23] unsigned int z, k; [L24] long long x, y, c; [L25] z = __VERIFIER_nondet_uint() [L26] CALL assume_abort_if_not(z>=0 && z<=5) VAL [\old(cond)=1] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L26] RET assume_abort_if_not(z>=0 && z<=5) VAL [z=0] [L27] k = __VERIFIER_nondet_uint() [L28] CALL assume_abort_if_not(k>=0 && k<=5) VAL [\old(cond)=1] [L13] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L28] RET assume_abort_if_not(k>=0 && k<=5) VAL [k=0, z=0] [L30] x = 1 [L31] y = z [L32] c = 1 VAL [c=1, k=0, x=1, y=0, z=0] [L34] COND TRUE 1 VAL [c=1, k=0, x=1, y=0, z=0] [L35] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L35] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [c=1, k=0, x=1, y=0, z=0] [L37] COND TRUE !(c < k) VAL [c=1, k=0, x=1, y=0, z=0] [L46] x = x * (z - 1) VAL [c=1, k=0, x=4294967295, y=0, z=0] [L48] CALL __VERIFIER_assert(1 + x - y == 0) VAL [\old(cond)=0] [L16] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L18] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 1.9s, OverallIterations: 3, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 28 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 23 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 64 mSDsCounter, 5 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 32 IncrementalHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5 mSolverCounterUnsat, 51 mSDtfsCounter, 32 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=31occurred in iteration=2, InterpolantAutomatonStates: 8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 2 StatesRemovedByMinimization, 1 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 76 NumberOfCodeBlocks, 76 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 44 ConstructedInterpolants, 0 QuantifiedInterpolants, 70 SizeOfPredicates, 1 NumberOfNonLiveVariables, 77 ConjunctsInSsa, 7 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 8/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 00:12:22,956 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...