/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/fermat2-ll_valuebound2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 03:09:51,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 03:09:51,137 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 03:09:51,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 03:09:51,162 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 03:09:51,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 03:09:51,165 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 03:09:51,169 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 03:09:51,170 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 03:09:51,175 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 03:09:51,176 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 03:09:51,177 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 03:09:51,177 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 03:09:51,180 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 03:09:51,180 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 03:09:51,183 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 03:09:51,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 03:09:51,184 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 03:09:51,186 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 03:09:51,192 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 03:09:51,193 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 03:09:51,194 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 03:09:51,194 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 03:09:51,195 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 03:09:51,196 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 03:09:51,201 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 03:09:51,201 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 03:09:51,201 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 03:09:51,202 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 03:09:51,202 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 03:09:51,202 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 03:09:51,203 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 03:09:51,203 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 03:09:51,203 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 03:09:51,204 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 03:09:51,204 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 03:09:51,204 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 03:09:51,205 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 03:09:51,205 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 03:09:51,205 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 03:09:51,206 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 03:09:51,208 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 03:09:51,209 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:09:51,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 03:09:51,231 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 03:09:51,231 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-15 03:09:51,232 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-15 03:09:51,232 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-15 03:09:51,232 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-15 03:09:51,232 INFO L138 SettingsManager]: * Use SBE=true [2022-04-15 03:09:51,232 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 03:09:51,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 03:09:51,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 03:09:51,233 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 03:09:51,233 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:09:51,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 03:09:51,234 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-15 03:09:51,234 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-15 03:09:51,234 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-15 03:09:51,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-15 03:09:51,234 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 03:09:51,234 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-04-15 03:09:51,234 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-04-15 03:09:51,235 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-04-15 03:09:51,235 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:09:51,553 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 03:09:51,570 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 03:09:51,572 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 03:09:51,573 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 03:09:51,574 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 03:09:51,575 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound2.c [2022-04-15 03:09:51,645 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cf5dd22/c5033cc504044cdc8d3bd34aba7adbce/FLAG505288fa2 [2022-04-15 03:09:51,967 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 03:09:51,967 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_valuebound2.c [2022-04-15 03:09:51,973 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cf5dd22/c5033cc504044cdc8d3bd34aba7adbce/FLAG505288fa2 [2022-04-15 03:09:51,987 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/02cf5dd22/c5033cc504044cdc8d3bd34aba7adbce [2022-04-15 03:09:51,990 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 03:09:51,991 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-04-15 03:09:51,993 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 03:09:51,993 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 03:09:51,995 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 03:09:51,999 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:09:51" (1/1) ... [2022-04-15 03:09:52,000 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36ee5ed8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:51, skipping insertion in model container [2022-04-15 03:09:52,001 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:09:51" (1/1) ... [2022-04-15 03:09:52,005 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 03:09:52,021 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 03:09:52,215 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/fermat2-ll_valuebound2.c[524,537] [2022-04-15 03:09:52,240 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:09:52,245 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 03:09:52,259 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/fermat2-ll_valuebound2.c[524,537] [2022-04-15 03:09:52,279 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 03:09:52,290 INFO L208 MainTranslator]: Completed translation [2022-04-15 03:09:52,291 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52 WrapperNode [2022-04-15 03:09:52,291 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 03:09:52,292 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 03:09:52,292 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 03:09:52,293 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 03:09:52,300 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,300 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,304 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,304 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,315 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,319 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,322 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,324 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 03:09:52,325 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 03:09:52,325 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 03:09:52,325 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 03:09:52,326 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 03:09:52,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:52,359 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:09:52,411 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:09:52,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 03:09:52,425 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 03:09:52,425 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 03:09:52,425 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 03:09:52,426 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 03:09:52,426 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 03:09:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 03:09:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 03:09:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 03:09:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 03:09:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 03:09:52,428 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 03:09:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 03:09:52,479 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 03:09:52,481 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 03:09:52,619 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 03:09:52,623 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 03:09:52,624 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-15 03:09:52,625 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:52 BoogieIcfgContainer [2022-04-15 03:09:52,625 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 03:09:52,625 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-04-15 03:09:52,625 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-04-15 03:09:52,626 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-04-15 03:09:52,628 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:52" (1/1) ... [2022-04-15 03:09:52,629 INFO L168 ansformationObserver]: Applying ICFG transformation LOOP_ACCELERATION_QVASR [2022-04-15 03:09:52,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:09:52 BasicIcfg [2022-04-15 03:09:52,653 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-04-15 03:09:52,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 03:09:52,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 03:09:52,656 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 03:09:52,656 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:09:51" (1/4) ... [2022-04-15 03:09:52,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb0d462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:09:52, skipping insertion in model container [2022-04-15 03:09:52,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:09:52" (2/4) ... [2022-04-15 03:09:52,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb0d462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:09:52, skipping insertion in model container [2022-04-15 03:09:52,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:09:52" (3/4) ... [2022-04-15 03:09:52,657 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6fb0d462 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:09:52, skipping insertion in model container [2022-04-15 03:09:52,657 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 15.04 03:09:52" (4/4) ... [2022-04-15 03:09:52,658 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_valuebound2.cqvasr [2022-04-15 03:09:52,661 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-15 03:09:52,661 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 03:09:52,719 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 03:09:52,736 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:09:52,736 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 03:09:52,762 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 03:09:52,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 03:09:52,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:52,767 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:09:52,767 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:52,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:52,771 INFO L85 PathProgramCache]: Analyzing trace with hash 1450325676, now seen corresponding path program 1 times [2022-04-15 03:09:52,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:52,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1162923082] [2022-04-15 03:09:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:52,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:52,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:52,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-15 03:09:52,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:52,974 INFO L290 TraceCheckUtils]: 0: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [78] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {35#true} is VALID [2022-04-15 03:09:52,975 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 03:09:52,975 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 03:09:52,976 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-15 03:09:52,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:52,994 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:52,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:52,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:52,995 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} [110] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~A~0_10) (<= v_main_~A~0_10 2)) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-15 03:09:52,996 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-04-15 03:09:53,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:53,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:53,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,012 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [111] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~R~0_6) (<= v_main_~R~0_6 2)) 1 0)) InVars {main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~R~0] {36#false} is VALID [2022-04-15 03:09:53,012 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 17 [2022-04-15 03:09:53,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:53,020 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:53,021 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,021 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,022 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [112] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (+ (* v_main_~R~0_7 v_main_~R~0_7) 1) (+ (* v_main_~R~0_7 2) v_main_~A~0_11)) 1 0)) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {36#false} is VALID [2022-04-15 03:09:53,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 22 [2022-04-15 03:09:53,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:53,032 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:53,033 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,033 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,034 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {36#false} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-15 03:09:53,035 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-15 03:09:53,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {56#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} [78] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {35#true} is VALID [2022-04-15 03:09:53,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 03:09:53,036 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 03:09:53,036 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {35#true} is VALID [2022-04-15 03:09:53,036 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} [80] mainENTRY-->L23: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~u~0=v_main_~u~0_4, main_~R~0=v_main_~R~0_1, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~A~0, main_~u~0, main_~R~0, main_~r~0] {35#true} is VALID [2022-04-15 03:09:53,036 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} [82] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~A~0_10) (<= v_main_~A~0_10 2)) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-15 03:09:53,036 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:53,038 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,038 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,039 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} [110] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~A~0_10) (<= v_main_~A~0_10 2)) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-15 03:09:53,039 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} [83] L23-1-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~R~0=v_main_~R~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~R~0] {36#false} is VALID [2022-04-15 03:09:53,040 INFO L272 TraceCheckUtils]: 12: Hoare triple {36#false} [85] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~R~0_6) (<= v_main_~R~0_6 2)) 1 0)) InVars {main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~R~0] {35#true} is VALID [2022-04-15 03:09:53,040 INFO L290 TraceCheckUtils]: 13: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:53,041 INFO L290 TraceCheckUtils]: 14: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,041 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,041 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {36#false} {36#false} [111] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~R~0_6) (<= v_main_~R~0_6 2)) 1 0)) InVars {main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~R~0] {36#false} is VALID [2022-04-15 03:09:53,042 INFO L272 TraceCheckUtils]: 17: Hoare triple {36#false} [88] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (+ (* v_main_~R~0_7 v_main_~R~0_7) 1) (+ (* v_main_~R~0_7 2) v_main_~A~0_11)) 1 0)) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {35#true} is VALID [2022-04-15 03:09:53,043 INFO L290 TraceCheckUtils]: 18: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:53,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,044 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {36#false} {36#false} [112] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (+ (* v_main_~R~0_7 v_main_~R~0_7) 1) (+ (* v_main_~R~0_7 2) v_main_~A~0_11)) 1 0)) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {36#false} is VALID [2022-04-15 03:09:53,045 INFO L272 TraceCheckUtils]: 22: Hoare triple {36#false} [90] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {35#true} is VALID [2022-04-15 03:09:53,045 INFO L290 TraceCheckUtils]: 23: Hoare triple {35#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {35#true} is VALID [2022-04-15 03:09:53,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {35#true} [86] L9-->L9-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {36#false} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,047 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {36#false} {36#false} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {36#false} is VALID [2022-04-15 03:09:53,047 INFO L290 TraceCheckUtils]: 27: Hoare triple {36#false} [91] L29-->L39-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_8)))) InVars {main_~A~0=v_main_~A~0_8, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_8, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {36#false} is VALID [2022-04-15 03:09:53,051 INFO L290 TraceCheckUtils]: 28: Hoare triple {36#false} [92] L39-2-->L35-2: Formula: false InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,052 INFO L272 TraceCheckUtils]: 29: Hoare triple {36#false} [95] L35-2-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* (- 2) v_main_~u~0_8) (* v_main_~v~0_8 2) (* v_main_~u~0_8 v_main_~u~0_8) (* (- 1) (* v_main_~v~0_8 v_main_~v~0_8))) (* v_main_~A~0_14 4)) 1 0) |v___VERIFIER_assert_#in~condInParam_2|) InVars {main_~v~0=v_main_~v~0_8, main_~A~0=v_main_~A~0_14, main_~u~0=v_main_~u~0_8} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_2|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0] {36#false} is VALID [2022-04-15 03:09:53,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {36#false} [98] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {36#false} is VALID [2022-04-15 03:09:53,053 INFO L290 TraceCheckUtils]: 31: Hoare triple {36#false} [102] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,053 INFO L290 TraceCheckUtils]: 32: Hoare triple {36#false} [106] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {36#false} is VALID [2022-04-15 03:09:53,053 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:09:53,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:09:53,054 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1162923082] [2022-04-15 03:09:53,056 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1162923082] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:09:53,056 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:09:53,056 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-15 03:09:53,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200043946] [2022-04-15 03:09:53,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:09:53,063 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, (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 33 [2022-04-15 03:09:53,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:09:53,068 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, (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:09:53,107 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:09:53,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-15 03:09:53,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:09:53,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-15 03:09:53,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-15 03:09:53,132 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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, (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:09:53,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:53,249 INFO L93 Difference]: Finished difference Result 57 states and 80 transitions. [2022-04-15 03:09:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-15 03:09:53,249 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, (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 33 [2022-04-15 03:09:53,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:09:53,250 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, (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:09:53,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-15 03:09:53,261 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, (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:09:53,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 80 transitions. [2022-04-15 03:09:53,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 80 transitions. [2022-04-15 03:09:53,352 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:09:53,361 INFO L225 Difference]: With dead ends: 57 [2022-04-15 03:09:53,361 INFO L226 Difference]: Without dead ends: 27 [2022-04-15 03:09:53,363 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:09:53,366 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 18 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 03:09:53,366 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 34 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 03:09:53,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-15 03:09:53,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-15 03:09:53,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:09:53,389 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:09:53,390 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:09:53,391 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:09:53,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:53,394 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 03:09:53,394 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 03:09:53,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:53,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:53,396 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-15 03:09:53,396 INFO L87 Difference]: Start difference. First operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 27 states. [2022-04-15 03:09:53,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:09:53,400 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2022-04-15 03:09:53,400 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 03:09:53,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:09:53,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:09:53,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:09:53,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:09:53,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 15 states have (on average 1.2) internal successors, (18), 16 states have internal predecessors, (18), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 03:09:53,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-04-15 03:09:53,405 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 33 [2022-04-15 03:09:53,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:09:53,406 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-04-15 03:09:53,407 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (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:09:53,407 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-04-15 03:09:53,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-15 03:09:53,408 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 03:09:53,408 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:09:53,409 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-15 03:09:53,409 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 03:09:53,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 03:09:53,416 INFO L85 PathProgramCache]: Analyzing trace with hash 512475503, now seen corresponding path program 1 times [2022-04-15 03:09:53,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 03:09:53,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824091281] [2022-04-15 03:09:53,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:53,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 03:09:53,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 03:09:53,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [96420753] [2022-04-15 03:09:53,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 03:09:53,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 03:09:53,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 03:09:53,449 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:09:53,505 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:09:53,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:53,527 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 03:09:53,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 03:09:53,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 03:09:59,706 WARN L232 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-15 03:10:16,164 WARN L232 SmtUtils]: Spent 16.40s on a formula simplification that was a NOOP. DAG size: 15 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 03:10:21,915 WARN L232 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-15 03:10:43,658 WARN L232 SmtUtils]: Spent 21.71s on a formula simplification that was a NOOP. DAG size: 29 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-15 03:10:49,422 WARN L232 SmtUtils]: Spent 5.73s on a formula simplification that was a NOOP. DAG size: 3 (called from [L1074] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-04-15 03:12:14,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {231#true} [76] ULTIMATE.startENTRY-->ULTIMATE.initENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 03:12:14,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {231#true} [78] 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| 3) 12) (= (select |v_#length_1| 2) 13) (= (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] {231#true} is VALID [2022-04-15 03:12:14,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {231#true} [81] ULTIMATE.initFINAL-->ULTIMATE.initEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 03:12:14,673 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {231#true} {231#true} [109] ULTIMATE.initEXIT-->L-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 03:12:14,673 INFO L272 TraceCheckUtils]: 4: Hoare triple {231#true} [77] L-1-->mainENTRY: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {231#true} is VALID [2022-04-15 03:12:14,674 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#true} [80] mainENTRY-->L23: Formula: (and (<= 0 (+ |v_main_#t~nondet4_2| 2147483648)) (<= |v_main_#t~nondet4_2| 2147483647) (= v_main_~A~0_2 |v_main_#t~nondet4_2|)) InVars {main_#t~nondet4=|v_main_#t~nondet4_2|} OutVars{main_~v~0=v_main_~v~0_4, main_~A~0=v_main_~A~0_2, main_~u~0=v_main_~u~0_4, main_~R~0=v_main_~R~0_1, main_~r~0=v_main_~r~0_5} AuxVars[] AssignedVars[main_#t~nondet4, main_~v~0, main_~A~0, main_~u~0, main_~R~0, main_~r~0] {231#true} is VALID [2022-04-15 03:12:14,674 INFO L272 TraceCheckUtils]: 6: Hoare triple {231#true} [82] L23-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~A~0_10) (<= v_main_~A~0_10 2)) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {231#true} is VALID [2022-04-15 03:12:14,674 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 03:12:14,675 INFO L290 TraceCheckUtils]: 8: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,675 INFO L290 TraceCheckUtils]: 9: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,676 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {231#true} [110] assume_abort_if_notEXIT-->L23-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_1| (ite (and (<= 0 v_main_~A~0_10) (<= v_main_~A~0_10 2)) 1 0)) InVars {main_~A~0=v_main_~A~0_10} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_1|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} is VALID [2022-04-15 03:12:14,678 INFO L290 TraceCheckUtils]: 11: Hoare triple {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} [83] L23-1-->L25: Formula: (and (<= |v_main_#t~nondet5_2| 2147483647) (= v_main_~R~0_2 |v_main_#t~nondet5_2|) (<= 0 (+ |v_main_#t~nondet5_2| 2147483648))) InVars {main_#t~nondet5=|v_main_#t~nondet5_2|} OutVars{main_~R~0=v_main_~R~0_2} AuxVars[] AssignedVars[main_#t~nondet5, main_~R~0] {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} is VALID [2022-04-15 03:12:14,678 INFO L272 TraceCheckUtils]: 12: Hoare triple {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} [85] L25-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~R~0_6) (<= v_main_~R~0_6 2)) 1 0)) InVars {main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~R~0] {231#true} is VALID [2022-04-15 03:12:14,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {231#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 03:12:14,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,681 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {268#(and (<= 0 main_~A~0) (<= main_~A~0 2))} [111] assume_abort_if_notEXIT-->L25-1: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_2| (ite (and (<= 0 v_main_~R~0_6) (<= v_main_~R~0_6 2)) 1 0)) InVars {main_~R~0=v_main_~R~0_6} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_2|} AuxVars[] AssignedVars[assume_abort_if_not_#in~cond, main_~R~0] {287#(and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0))} is VALID [2022-04-15 03:12:14,681 INFO L272 TraceCheckUtils]: 17: Hoare triple {287#(and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0))} [88] L25-1-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (+ (* v_main_~R~0_7 v_main_~R~0_7) 1) (+ (* v_main_~R~0_7 2) v_main_~A~0_11)) 1 0)) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {231#true} is VALID [2022-04-15 03:12:14,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {231#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 03:12:14,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,684 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {287#(and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0))} [112] assume_abort_if_notEXIT-->L27: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_3| (ite (< (+ (* v_main_~R~0_7 v_main_~R~0_7) 1) (+ (* v_main_~R~0_7 2) v_main_~A~0_11)) 1 0)) InVars {main_~A~0=v_main_~A~0_11, main_~R~0=v_main_~R~0_7} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_3|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond, main_~R~0] {303#(and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} is VALID [2022-04-15 03:12:14,684 INFO L272 TraceCheckUtils]: 22: Hoare triple {303#(and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} [90] L27-->assume_abort_if_notENTRY: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {231#true} is VALID [2022-04-15 03:12:14,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {231#true} [84] assume_abort_if_notENTRY-->L9: Formula: (= |v_assume_abort_if_not_#in~cond_1| v_assume_abort_if_not_~cond_1) InVars {assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~cond_1|, assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_1} AuxVars[] AssignedVars[assume_abort_if_not_~cond] {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 03:12:14,685 INFO L290 TraceCheckUtils]: 24: Hoare triple {257#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} [87] L9-->L9-2: Formula: (not (= v_assume_abort_if_not_~cond_3 0)) InVars {assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} OutVars{assume_abort_if_not_~cond=v_assume_abort_if_not_~cond_3} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,685 INFO L290 TraceCheckUtils]: 25: Hoare triple {261#(not (= |assume_abort_if_not_#in~cond| 0))} [89] L9-2-->assume_abort_if_notEXIT: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {261#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 03:12:14,686 INFO L284 TraceCheckUtils]: 26: Hoare quadruple {261#(not (= |assume_abort_if_not_#in~cond| 0))} {303#(and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} [113] assume_abort_if_notEXIT-->L29: AOR: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] LVA: Formula: (= |v_assume_abort_if_not_#in~condInParam_4| (ite (= (let ((.cse0 (mod v_main_~A~0_12 2))) (ite (and (< v_main_~A~0_12 0) (not (= .cse0 0))) (+ (- 2) .cse0) .cse0)) 1) 1 0)) InVars {main_~A~0=v_main_~A~0_12} OutVars{assume_abort_if_not_#in~cond=|v_assume_abort_if_not_#in~condInParam_4|} AuxVars[] AssignedVars[main_~A~0, assume_abort_if_not_#in~cond] {319#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1) (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} is VALID [2022-04-15 03:12:14,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {319#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1) (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2))))} [91] L29-->L39-2: Formula: (and (= v_main_~u~0_5 (+ (* v_main_~R~0_5 2) 1)) (= v_main_~v~0_5 1) (= v_main_~r~0_6 (+ (* v_main_~R~0_5 v_main_~R~0_5) (* (- 1) v_main_~A~0_8)))) InVars {main_~A~0=v_main_~A~0_8, main_~R~0=v_main_~R~0_5} OutVars{main_~v~0=v_main_~v~0_5, main_~A~0=v_main_~A~0_8, main_~R~0=v_main_~R~0_5, main_~u~0=v_main_~u~0_5, main_~r~0=v_main_~r~0_6} AuxVars[] AssignedVars[main_~v~0, main_~u~0, main_~r~0] {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} is VALID [2022-04-15 03:12:14,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} [94] L39-2-->L36: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} is VALID [2022-04-15 03:12:14,698 INFO L272 TraceCheckUtils]: 29: Hoare triple {323#(and (<= 0 main_~A~0) (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= (mod main_~A~0 2) 1) (< (+ (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2))) 1) (+ main_~A~0 (* 2 (div (+ (* (- 1) main_~u~0) 1) (- 2))))) (<= main_~A~0 2) (= main_~v~0 1))} [96] L36-->__VERIFIER_assertENTRY: Formula: (= (ite (= (+ (* v_main_~u~0_7 v_main_~u~0_7) (* (- 1) (* v_main_~v~0_7 v_main_~v~0_7)) (* (- 2) v_main_~u~0_7) (* v_main_~v~0_7 2)) (+ (* v_main_~A~0_13 4) (* v_main_~r~0_10 4))) 1 0) |v___VERIFIER_assert_#in~condInParam_1|) InVars {main_~v~0=v_main_~v~0_7, main_~A~0=v_main_~A~0_13, main_~u~0=v_main_~u~0_7, main_~r~0=v_main_~r~0_10} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~condInParam_1|} AuxVars[] AssignedVars[__VERIFIER_assert_#in~cond, main_~v~0, main_~A~0, main_~u~0, main_~r~0] {330#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 03:12:14,699 INFO L290 TraceCheckUtils]: 30: Hoare triple {330#(<= 1 |__VERIFIER_assert_#in~cond|)} [98] __VERIFIER_assertENTRY-->L12: Formula: (= v___VERIFIER_assert_~cond_1 |v___VERIFIER_assert_#in~cond_1|) InVars {__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|} OutVars{__VERIFIER_assert_#in~cond=|v___VERIFIER_assert_#in~cond_1|, __VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_1} AuxVars[] AssignedVars[__VERIFIER_assert_~cond] {334#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 03:12:14,700 INFO L290 TraceCheckUtils]: 31: Hoare triple {334#(<= 1 __VERIFIER_assert_~cond)} [102] L12-->L13: Formula: (= v___VERIFIER_assert_~cond_2 0) InVars {__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} OutVars{__VERIFIER_assert_~cond=v___VERIFIER_assert_~cond_2} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-15 03:12:14,700 INFO L290 TraceCheckUtils]: 32: Hoare triple {232#false} [106] L13-->__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: true InVars {} OutVars{} AuxVars[] AssignedVars[] {232#false} is VALID [2022-04-15 03:12:14,700 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:12:14,700 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 03:12:14,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 03:12:14,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824091281] [2022-04-15 03:12:14,701 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 03:12:14,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [96420753] [2022-04-15 03:12:14,701 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [96420753] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 03:12:14,702 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 03:12:14,703 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 03:12:14,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438639077] [2022-04-15 03:12:14,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 03:12:14,704 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2022-04-15 03:12:14,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 03:12:14,706 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:12:14,737 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:12:14,738 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 03:12:14,739 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-15 03:12:14,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 03:12:14,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-15 03:12:14,744 INFO L87 Difference]: Start difference. First operand 27 states and 32 transitions. Second operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:12:15,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:12:15,431 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-04-15 03:12:15,431 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 03:12:15,431 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) Word has length 33 [2022-04-15 03:12:15,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 03:12:15,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:12:15,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-15 03:12:15,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:12:15,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 42 transitions. [2022-04-15 03:12:15,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 42 transitions. [2022-04-15 03:12:15,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 03:12:15,482 INFO L225 Difference]: With dead ends: 35 [2022-04-15 03:12:15,482 INFO L226 Difference]: Without dead ends: 0 [2022-04-15 03:12:15,483 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 38.3s TimeCoverageRelationStatistics Valid=41, Invalid=141, Unknown=0, NotChecked=0, Total=182 [2022-04-15 03:12:15,484 INFO L913 BasicCegarLoop]: 17 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 03:12:15,484 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 86 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 03:12:15,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-15 03:12:15,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-15 03:12:15,485 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 03:12:15,485 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 03:12:15,486 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 03:12:15,486 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 03:12:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:12:15,486 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:12:15,486 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:12:15,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:12:15,486 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:12:15,486 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 03:12:15,486 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-15 03:12:15,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 03:12:15,487 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-15 03:12:15,487 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:12:15,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:12:15,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 03:12:15,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 03:12:15,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 03:12:15,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-15 03:12:15,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-15 03:12:15,487 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 33 [2022-04-15 03:12:15,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 03:12:15,487 INFO L478 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-15 03:12:15,488 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 1.3333333333333333) internal successors, (12), 7 states have internal predecessors, (12), 5 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 03:12:15,488 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-15 03:12:15,488 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 03:12:15,490 INFO L788 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-15 03:12:15,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-15 03:12:15,702 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:12:15,704 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-15 03:12:15,802 INFO L878 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-15 03:12:15,803 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:12:15,803 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:12:15,803 INFO L885 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-15 03:12:15,803 INFO L885 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-15 03:12:15,803 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-04-15 03:12:15,803 INFO L882 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-04-15 03:12:15,803 INFO L885 garLoopResultBuilder]: At program point assume_abort_if_notENTRY(lines 8 10) the Hoare annotation is: true [2022-04-15 03:12:15,803 INFO L882 garLoopResultBuilder]: For program point L9(line 9) no Hoare annotation was computed. [2022-04-15 03:12:15,803 INFO L882 garLoopResultBuilder]: For program point L9-2(lines 8 10) no Hoare annotation was computed. [2022-04-15 03:12:15,803 INFO L882 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 8 10) no Hoare annotation was computed. [2022-04-15 03:12:15,803 INFO L885 garLoopResultBuilder]: At program point mainENTRY(lines 19 51) the Hoare annotation is: true [2022-04-15 03:12:15,803 INFO L885 garLoopResultBuilder]: At program point L23(line 23) the Hoare annotation is: true [2022-04-15 03:12:15,804 INFO L882 garLoopResultBuilder]: For program point L23-1(line 23) no Hoare annotation was computed. [2022-04-15 03:12:15,804 INFO L878 garLoopResultBuilder]: At program point L25(line 25) the Hoare annotation is: (and (<= 0 main_~A~0) (<= main_~A~0 2)) [2022-04-15 03:12:15,804 INFO L878 garLoopResultBuilder]: At program point L25-1(line 25) the Hoare annotation is: (and (<= 0 main_~A~0) (<= main_~R~0 2) (<= main_~A~0 2) (<= 0 main_~R~0)) [2022-04-15 03:12:15,804 INFO L878 garLoopResultBuilder]: At program point L27(line 27) the Hoare annotation is: (and (<= main_~A~0 2) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))) [2022-04-15 03:12:15,804 INFO L882 garLoopResultBuilder]: For program point L29(line 29) no Hoare annotation was computed. [2022-04-15 03:12:15,804 INFO L878 garLoopResultBuilder]: At program point L39-2(lines 35 46) the Hoare annotation is: (let ((.cse1 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (let ((.cse0 (* .cse1 .cse1))) (and (= (mod (+ main_~u~0 1) 2) 0) (= (+ main_~A~0 main_~r~0) .cse0) (= (mod main_~A~0 2) 1) (< (+ .cse0 1) (+ main_~A~0 (* 2 .cse1))) (<= main_~A~0 2) (= main_~v~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))))) [2022-04-15 03:12:15,804 INFO L878 garLoopResultBuilder]: At program point L35-2(lines 35 46) the Hoare annotation is: (let ((.cse1 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (let ((.cse0 (* .cse1 .cse1))) (and (= (mod (+ main_~u~0 1) 2) 0) (= (+ main_~A~0 main_~r~0) .cse0) (= (mod main_~A~0 2) 1) (< (+ .cse0 1) (+ main_~A~0 (* 2 .cse1))) (<= main_~A~0 2) (= main_~v~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))))) [2022-04-15 03:12:15,804 INFO L878 garLoopResultBuilder]: At program point L36(line 36) the Hoare annotation is: (let ((.cse1 (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (let ((.cse0 (* .cse1 .cse1))) (and (= (mod (+ main_~u~0 1) 2) 0) (= (+ main_~A~0 main_~r~0) .cse0) (= (mod main_~A~0 2) 1) (< (+ .cse0 1) (+ main_~A~0 (* 2 .cse1))) (<= main_~A~0 2) (= main_~v~0 1) (< (+ (* main_~R~0 main_~R~0) 1) (+ main_~A~0 (* main_~R~0 2)))))) [2022-04-15 03:12:15,804 INFO L882 garLoopResultBuilder]: For program point L49(line 49) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point L36-1(lines 35 46) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point mainFINAL(lines 19 51) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point L39(lines 39 45) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point mainEXIT(lines 19 51) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L885 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 11 17) the Hoare annotation is: true [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point L12(lines 12 15) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point L13(lines 13 14) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point L12-2(lines 11 17) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 14) no Hoare annotation was computed. [2022-04-15 03:12:15,805 INFO L882 garLoopResultBuilder]: For program point __VERIFIER_assertEXIT(lines 11 17) no Hoare annotation was computed. [2022-04-15 03:12:15,808 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1] [2022-04-15 03:12:15,809 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:12:15,812 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L23-1 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L29 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L36-1 has no Hoare annotation [2022-04-15 03:12:15,813 WARN L170 areAnnotationChecker]: L49 has no Hoare annotation [2022-04-15 03:12:15,818 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 03:12:15,818 WARN L170 areAnnotationChecker]: L39 has no Hoare annotation [2022-04-15 03:12:15,818 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-15 03:12:15,818 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-15 03:12:15,818 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-15 03:12:15,818 INFO L163 areAnnotationChecker]: CFG has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-15 03:12:15,827 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.04 03:12:15 BasicIcfg [2022-04-15 03:12:15,827 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-15 03:12:15,828 INFO L158 Benchmark]: Toolchain (without parser) took 143836.18ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 128.0MB in the beginning and 106.2MB in the end (delta: 21.8MB). Peak memory consumption was 90.9MB. Max. memory is 8.0GB. [2022-04-15 03:12:15,828 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 187.7MB. Free memory was 144.4MB in the beginning and 144.3MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-15 03:12:15,828 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.45ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 127.9MB in the beginning and 226.2MB in the end (delta: -98.4MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. [2022-04-15 03:12:15,829 INFO L158 Benchmark]: Boogie Preprocessor took 32.19ms. Allocated memory is still 256.9MB. Free memory was 226.2MB in the beginning and 224.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-15 03:12:15,829 INFO L158 Benchmark]: RCFGBuilder took 299.73ms. Allocated memory is still 256.9MB. Free memory was 224.8MB in the beginning and 212.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. [2022-04-15 03:12:15,829 INFO L158 Benchmark]: IcfgTransformer took 28.07ms. Allocated memory is still 256.9MB. Free memory was 212.7MB in the beginning and 210.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-15 03:12:15,830 INFO L158 Benchmark]: TraceAbstraction took 143172.56ms. Allocated memory is still 256.9MB. Free memory was 210.1MB in the beginning and 106.2MB in the end (delta: 103.9MB). Peak memory consumption was 105.5MB. Max. memory is 8.0GB. [2022-04-15 03:12:15,831 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.10ms. Allocated memory is still 187.7MB. Free memory was 144.4MB in the beginning and 144.3MB in the end (delta: 132.9kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 298.45ms. Allocated memory was 187.7MB in the beginning and 256.9MB in the end (delta: 69.2MB). Free memory was 127.9MB in the beginning and 226.2MB in the end (delta: -98.4MB). Peak memory consumption was 10.6MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.19ms. Allocated memory is still 256.9MB. Free memory was 226.2MB in the beginning and 224.8MB in the end (delta: 1.4MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 299.73ms. Allocated memory is still 256.9MB. Free memory was 224.8MB in the beginning and 212.7MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 8.0GB. * IcfgTransformer took 28.07ms. Allocated memory is still 256.9MB. Free memory was 212.7MB in the beginning and 210.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * TraceAbstraction took 143172.56ms. Allocated memory is still 256.9MB. Free memory was 210.1MB in the beginning and 106.2MB in the end (delta: 103.9MB). Peak memory consumption was 105.5MB. 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 - PositiveResult [Line: 14]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 32 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 143.1s, OverallIterations: 2, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 38 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 29 mSDsluCounter, 120 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 72 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 112 IncrementalHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 48 mSDtfsCounter, 112 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 38.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=32occurred in iteration=0, InterpolantAutomatonStates: 14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 13 LocationsWithAnnotation, 24 PreInvPairs, 30 NumberOfFragments, 282 HoareAnnotationTreeSize, 24 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 13 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 141.3s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 2 NumberOfCheckSat, 64 ConstructedInterpolants, 0 QuantifiedInterpolants, 308 SizeOfPredicates, 6 NumberOfNonLiveVariables, 99 ConjunctsInSsa, 29 ConjunctsInUnsatCore, 2 InterpolantComputations, 2 PerfectInterpolantSequences, 48/48 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 - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: ((((((u + 1) % 2 == 0 && A + r == (-1 * u + 1) / -2 * ((-1 * u + 1) / -2)) && A % 2 == 1) && (-1 * u + 1) / -2 * ((-1 * u + 1) / -2) + 1 < A + 2 * ((-1 * u + 1) / -2)) && A <= 2) && v == 1) && R * R + 1 < A + R * 2 RESULT: Ultimate proved your program to be correct! [2022-04-15 03:12:15,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...