./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c3fed411 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a --- Real Ultimate output --- This is Ultimate 0.2.2-tmp.no-commuhash-c3fed41 [2021-12-17 12:15:00,886 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-17 12:15:00,888 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-17 12:15:00,918 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-17 12:15:00,919 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-17 12:15:00,922 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-17 12:15:00,923 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-17 12:15:00,929 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-17 12:15:00,930 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-17 12:15:00,936 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-17 12:15:00,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-17 12:15:00,937 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-17 12:15:00,938 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-17 12:15:00,939 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-17 12:15:00,941 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-17 12:15:00,943 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-17 12:15:00,944 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-17 12:15:00,945 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-17 12:15:00,947 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-17 12:15:00,950 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-17 12:15:00,955 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-17 12:15:00,956 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-17 12:15:00,957 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-17 12:15:00,959 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-17 12:15:00,961 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-17 12:15:00,962 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-17 12:15:00,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-17 12:15:00,963 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-17 12:15:00,965 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-17 12:15:00,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-17 12:15:00,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-17 12:15:00,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-17 12:15:00,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-17 12:15:00,967 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-17 12:15:00,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-17 12:15:00,968 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-17 12:15:00,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-17 12:15:00,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-17 12:15:00,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-17 12:15:00,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-17 12:15:00,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-17 12:15:00,971 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2021-12-17 12:15:01,004 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-17 12:15:01,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-17 12:15:01,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-17 12:15:01,005 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-17 12:15:01,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-12-17 12:15:01,006 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2021-12-17 12:15:01,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-17 12:15:01,007 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-17 12:15:01,007 INFO L138 SettingsManager]: * Use SBE=true [2021-12-17 12:15:01,007 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-17 12:15:01,008 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-17 12:15:01,008 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-17 12:15:01,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-17 12:15:01,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-17 12:15:01,009 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-12-17 12:15:01,009 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-12-17 12:15:01,009 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-12-17 12:15:01,009 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-17 12:15:01,010 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-17 12:15:01,010 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-17 12:15:01,010 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-12-17 12:15:01,010 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-17 12:15:01,010 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-17 12:15:01,010 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-12-17 12:15:01,011 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:15:01,011 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-17 12:15:01,011 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-12-17 12:15:01,012 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-12-17 12:15:01,013 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-17 12:15:01,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-12-17 12:15:01,013 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2021-12-17 12:15:01,013 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2021-12-17 12:15:01,013 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-12-17 12:15:01,014 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-17 12:15:01,014 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> c16561338eb70030ddc560fe6b7af6d1b48b7a566766a02092344cb5475a4c1a [2021-12-17 12:15:01,273 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-17 12:15:01,294 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-17 12:15:01,296 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-17 12:15:01,297 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-17 12:15:01,298 INFO L275 PluginConnector]: CDTParser initialized [2021-12-17 12:15:01,299 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2021-12-17 12:15:01,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b54c6dd/df0d897576a2456c91d61b97af01edf5/FLAGf3f18c932 [2021-12-17 12:15:01,704 INFO L306 CDTParser]: Found 1 translation units. [2021-12-17 12:15:01,705 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2021-12-17 12:15:01,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b54c6dd/df0d897576a2456c91d61b97af01edf5/FLAGf3f18c932 [2021-12-17 12:15:01,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/39b54c6dd/df0d897576a2456c91d61b97af01edf5 [2021-12-17 12:15:01,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-17 12:15:01,723 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-17 12:15:01,724 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-17 12:15:01,724 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-17 12:15:01,727 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-17 12:15:01,727 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:01,728 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@662d6d93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01, skipping insertion in model container [2021-12-17 12:15:01,728 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:01,734 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-17 12:15:01,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-17 12:15:01,886 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c[524,537] [2021-12-17 12:15:01,903 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:15:01,910 INFO L203 MainTranslator]: Completed pre-run [2021-12-17 12:15:01,926 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound20.c[524,537] [2021-12-17 12:15:01,945 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-17 12:15:01,957 INFO L208 MainTranslator]: Completed translation [2021-12-17 12:15:01,957 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01 WrapperNode [2021-12-17 12:15:01,957 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-17 12:15:01,958 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-17 12:15:01,958 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-17 12:15:01,959 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-17 12:15:01,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:01,969 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:01,986 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2021-12-17 12:15:01,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-17 12:15:01,988 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-17 12:15:01,988 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-17 12:15:01,988 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-17 12:15:01,995 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:01,995 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:02,003 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:02,003 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:02,010 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:02,018 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:02,019 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:02,021 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-17 12:15:02,021 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-17 12:15:02,021 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-17 12:15:02,022 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-17 12:15:02,022 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (1/1) ... [2021-12-17 12:15:02,028 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-12-17 12:15:02,038 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:02,054 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) [2021-12-17 12:15:02,084 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 [2021-12-17 12:15:02,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-17 12:15:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2021-12-17 12:15:02,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2021-12-17 12:15:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-17 12:15:02,100 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-17 12:15:02,100 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-17 12:15:02,101 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2021-12-17 12:15:02,101 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2021-12-17 12:15:02,154 INFO L236 CfgBuilder]: Building ICFG [2021-12-17 12:15:02,155 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-17 12:15:02,286 INFO L277 CfgBuilder]: Performing block encoding [2021-12-17 12:15:02,292 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-17 12:15:02,292 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-17 12:15:02,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:15:02 BoogieIcfgContainer [2021-12-17 12:15:02,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-17 12:15:02,294 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-12-17 12:15:02,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-12-17 12:15:02,297 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-12-17 12:15:02,297 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.12 12:15:01" (1/3) ... [2021-12-17 12:15:02,298 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a384a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:15:02, skipping insertion in model container [2021-12-17 12:15:02,298 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.12 12:15:01" (2/3) ... [2021-12-17 12:15:02,299 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@27a384a6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.12 12:15:02, skipping insertion in model container [2021-12-17 12:15:02,299 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:15:02" (3/3) ... [2021-12-17 12:15:02,300 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2021-12-17 12:15:02,303 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-12-17 12:15:02,304 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2021-12-17 12:15:02,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-12-17 12:15:02,342 INFO L339 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=PETRI_NET, 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, mLoopAccelerationTechnique=FAST_UPR [2021-12-17 12:15:02,342 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2021-12-17 12:15:02,355 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 12:15:02,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-12-17 12:15:02,360 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:02,360 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:02,361 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:02,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:02,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2021-12-17 12:15:02,372 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:02,373 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106970039] [2021-12-17 12:15:02,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:02,374 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:02,435 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:02,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990954337] [2021-12-17 12:15:02,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:02,436 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:02,436 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:02,442 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) [2021-12-17 12:15:02,443 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2021-12-17 12:15:02,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:15:02,503 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2021-12-17 12:15:02,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:15:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-12-17 12:15:02,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:15:02,580 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:15:02,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106970039] [2021-12-17 12:15:02,581 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:15:02,581 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990954337] [2021-12-17 12:15:02,581 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990954337] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:15:02,582 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:15:02,583 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-17 12:15:02,585 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063884327] [2021-12-17 12:15:02,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:15:02,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2021-12-17 12:15:02,590 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:15:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2021-12-17 12:15:02,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 12:15:02,623 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.411764705882353) internal successors, (24), 18 states have internal predecessors, (24), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:15:02,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:15:02,644 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2021-12-17 12:15:02,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2021-12-17 12:15:02,646 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2021-12-17 12:15:02,647 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:15:02,653 INFO L225 Difference]: With dead ends: 47 [2021-12-17 12:15:02,653 INFO L226 Difference]: Without dead ends: 21 [2021-12-17 12:15:02,656 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2021-12-17 12:15:02,664 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:15:02,667 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 12:15:02,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2021-12-17 12:15:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2021-12-17 12:15:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.2857142857142858) internal successors, (18), 15 states have internal predecessors, (18), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 12:15:02,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2021-12-17 12:15:02,751 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2021-12-17 12:15:02,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:15:02,752 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2021-12-17 12:15:02,752 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2021-12-17 12:15:02,752 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2021-12-17 12:15:02,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 12:15:02,754 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:02,754 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:02,770 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2021-12-17 12:15:02,955 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2021-12-17 12:15:02,956 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:02,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:02,956 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2021-12-17 12:15:02,956 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:02,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905584165] [2021-12-17 12:15:02,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:02,957 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:02,966 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:02,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1912198235] [2021-12-17 12:15:02,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:02,966 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:02,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:02,970 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 12:15:03,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2021-12-17 12:15:03,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:15:03,035 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2021-12-17 12:15:03,036 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:15:03,133 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:03,133 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:15:03,134 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:15:03,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905584165] [2021-12-17 12:15:03,134 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:15:03,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1912198235] [2021-12-17 12:15:03,134 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1912198235] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:15:03,135 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:15:03,135 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-17 12:15:03,135 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633666159] [2021-12-17 12:15:03,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:15:03,136 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-12-17 12:15:03,136 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:15:03,137 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-12-17 12:15:03,137 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 12:15:03,137 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 12:15:03,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:15:03,154 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2021-12-17 12:15:03,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-12-17 12:15:03,160 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-12-17 12:15:03,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:15:03,161 INFO L225 Difference]: With dead ends: 30 [2021-12-17 12:15:03,162 INFO L226 Difference]: Without dead ends: 23 [2021-12-17 12:15:03,162 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-12-17 12:15:03,164 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 0 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:15:03,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 12:15:03,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2021-12-17 12:15:03,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2021-12-17 12:15:03,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 12:15:03,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2021-12-17 12:15:03,175 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2021-12-17 12:15:03,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:15:03,176 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2021-12-17 12:15:03,177 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 12:15:03,177 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2021-12-17 12:15:03,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-12-17 12:15:03,178 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:03,179 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:03,198 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2021-12-17 12:15:03,391 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2021-12-17 12:15:03,392 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:03,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:03,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2021-12-17 12:15:03,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:03,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294852921] [2021-12-17 12:15:03,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:03,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:03,405 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:03,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1818066969] [2021-12-17 12:15:03,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:03,406 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:03,406 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:03,407 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 12:15:03,409 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2021-12-17 12:15:03,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:15:03,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2021-12-17 12:15:03,468 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:15:03,609 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:03,609 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2021-12-17 12:15:03,610 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:15:03,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1294852921] [2021-12-17 12:15:03,610 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:15:03,610 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1818066969] [2021-12-17 12:15:03,610 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1818066969] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-17 12:15:03,610 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-17 12:15:03,611 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-12-17 12:15:03,611 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1567161081] [2021-12-17 12:15:03,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-17 12:15:03,611 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-12-17 12:15:03,612 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:15:03,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-12-17 12:15:03,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-12-17 12:15:03,612 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 12:15:05,652 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2021-12-17 12:15:05,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:15:05,677 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2021-12-17 12:15:05,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-12-17 12:15:05,677 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2021-12-17 12:15:05,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:15:05,679 INFO L225 Difference]: With dead ends: 33 [2021-12-17 12:15:05,679 INFO L226 Difference]: Without dead ends: 31 [2021-12-17 12:15:05,679 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-12-17 12:15:05,680 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 0 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:15:05,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 29 Invalid, 1 Unknown, 0 Unchecked, 2.0s Time] [2021-12-17 12:15:05,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2021-12-17 12:15:05,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 28. [2021-12-17 12:15:05,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 21 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2021-12-17 12:15:05,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 32 transitions. [2021-12-17 12:15:05,687 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 32 transitions. Word has length 19 [2021-12-17 12:15:05,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:15:05,687 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 32 transitions. [2021-12-17 12:15:05,687 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2021-12-17 12:15:05,688 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 32 transitions. [2021-12-17 12:15:05,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-12-17 12:15:05,688 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:05,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:05,706 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2021-12-17 12:15:05,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:05,896 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:05,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:05,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2021-12-17 12:15:05,896 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:05,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850054543] [2021-12-17 12:15:05,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:05,897 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:05,906 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:05,906 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103742165] [2021-12-17 12:15:05,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:05,909 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:05,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:05,910 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 12:15:05,911 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2021-12-17 12:15:05,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:15:05,944 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2021-12-17 12:15:05,945 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:15:06,124 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:06,124 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:15:06,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:06,305 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:15:06,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850054543] [2021-12-17 12:15:06,305 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:15:06,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103742165] [2021-12-17 12:15:06,306 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103742165] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:15:06,306 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:15:06,306 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2021-12-17 12:15:06,306 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163039656] [2021-12-17 12:15:06,306 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:15:06,307 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2021-12-17 12:15:06,307 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:15:06,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2021-12-17 12:15:06,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2021-12-17 12:15:06,308 INFO L87 Difference]: Start difference. First operand 28 states and 32 transitions. Second operand has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 12:15:06,387 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:15:06,387 INFO L93 Difference]: Finished difference Result 35 states and 38 transitions. [2021-12-17 12:15:06,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-12-17 12:15:06,388 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2021-12-17 12:15:06,388 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:15:06,390 INFO L225 Difference]: With dead ends: 35 [2021-12-17 12:15:06,390 INFO L226 Difference]: Without dead ends: 30 [2021-12-17 12:15:06,391 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2021-12-17 12:15:06,392 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 28 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:15:06,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 76 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 12:15:06,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2021-12-17 12:15:06,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2021-12-17 12:15:06,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 18 states have internal predecessors, (20), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2021-12-17 12:15:06,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2021-12-17 12:15:06,398 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2021-12-17 12:15:06,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:15:06,398 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2021-12-17 12:15:06,398 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.0) internal successors, (18), 7 states have internal predecessors, (18), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2021-12-17 12:15:06,398 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2021-12-17 12:15:06,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2021-12-17 12:15:06,399 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:06,399 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:06,423 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2021-12-17 12:15:06,613 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:06,613 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:06,613 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:06,614 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2021-12-17 12:15:06,614 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:06,614 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188122303] [2021-12-17 12:15:06,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:06,614 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:06,621 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:06,621 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1773381375] [2021-12-17 12:15:06,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:06,621 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:06,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:06,623 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 12:15:06,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2021-12-17 12:15:06,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-17 12:15:06,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2021-12-17 12:15:06,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:15:06,719 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:06,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:15:06,796 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:06,796 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:15:06,796 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188122303] [2021-12-17 12:15:06,797 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:15:06,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1773381375] [2021-12-17 12:15:06,797 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1773381375] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:15:06,797 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:15:06,797 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2021-12-17 12:15:06,798 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [824147078] [2021-12-17 12:15:06,798 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:15:06,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-12-17 12:15:06,798 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:15:06,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-12-17 12:15:06,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2021-12-17 12:15:06,799 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 12:15:06,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:15:06,858 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2021-12-17 12:15:06,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2021-12-17 12:15:06,859 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) Word has length 28 [2021-12-17 12:15:06,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:15:06,860 INFO L225 Difference]: With dead ends: 57 [2021-12-17 12:15:06,860 INFO L226 Difference]: Without dead ends: 52 [2021-12-17 12:15:06,860 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2021-12-17 12:15:06,861 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 41 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2021-12-17 12:15:06,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 101 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2021-12-17 12:15:06,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2021-12-17 12:15:06,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2021-12-17 12:15:06,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 states have internal predecessors, (44), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2021-12-17 12:15:06,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2021-12-17 12:15:06,870 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2021-12-17 12:15:06,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:15:06,871 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2021-12-17 12:15:06,871 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 5 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (6), 4 states have call predecessors, (6), 4 states have call successors, (6) [2021-12-17 12:15:06,871 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2021-12-17 12:15:06,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2021-12-17 12:15:06,872 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:06,873 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:06,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2021-12-17 12:15:07,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:07,084 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2021-12-17 12:15:07,084 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:07,085 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550707628] [2021-12-17 12:15:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:07,085 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:07,092 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:07,093 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464330864] [2021-12-17 12:15:07,093 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2021-12-17 12:15:07,093 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:07,093 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:07,094 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 12:15:07,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2021-12-17 12:15:07,137 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2021-12-17 12:15:07,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:15:07,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2021-12-17 12:15:07,141 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:15:07,284 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:07,284 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:15:07,446 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2021-12-17 12:15:07,447 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:15:07,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550707628] [2021-12-17 12:15:07,447 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:15:07,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464330864] [2021-12-17 12:15:07,447 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464330864] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:15:07,447 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:15:07,448 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2021-12-17 12:15:07,448 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1549793298] [2021-12-17 12:15:07,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:15:07,450 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2021-12-17 12:15:07,450 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:15:07,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-12-17 12:15:07,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2021-12-17 12:15:07,451 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-17 12:15:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:15:07,624 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2021-12-17 12:15:07,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2021-12-17 12:15:07,624 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) Word has length 55 [2021-12-17 12:15:07,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:15:07,626 INFO L225 Difference]: With dead ends: 111 [2021-12-17 12:15:07,626 INFO L226 Difference]: Without dead ends: 106 [2021-12-17 12:15:07,626 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2021-12-17 12:15:07,627 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 98 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 12:15:07,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 131 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 12:15:07,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2021-12-17 12:15:07,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2021-12-17 12:15:07,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 81 states have (on average 1.1358024691358024) internal successors, (92), 81 states have internal predecessors, (92), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2021-12-17 12:15:07,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2021-12-17 12:15:07,645 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2021-12-17 12:15:07,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:15:07,646 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2021-12-17 12:15:07,646 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.714285714285714) internal successors, (66), 14 states have internal predecessors, (66), 11 states have call successors, (13), 7 states have call predecessors, (13), 6 states have return successors, (12), 10 states have call predecessors, (12), 10 states have call successors, (12) [2021-12-17 12:15:07,646 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2021-12-17 12:15:07,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2021-12-17 12:15:07,648 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:07,649 INFO L514 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:07,675 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2021-12-17 12:15:07,862 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:07,863 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:07,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:07,863 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2021-12-17 12:15:07,863 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:07,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037238902] [2021-12-17 12:15:07,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:07,864 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:07,872 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:07,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [901985869] [2021-12-17 12:15:07,872 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2021-12-17 12:15:07,872 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:07,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:07,873 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 12:15:07,875 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2021-12-17 12:15:10,601 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2021-12-17 12:15:10,601 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2021-12-17 12:15:10,604 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2021-12-17 12:15:10,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-12-17 12:15:10,901 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2021-12-17 12:15:10,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-12-17 12:15:11,251 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2021-12-17 12:15:11,251 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-17 12:15:11,251 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037238902] [2021-12-17 12:15:11,251 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2021-12-17 12:15:11,252 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901985869] [2021-12-17 12:15:11,252 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901985869] provided 0 perfect and 2 imperfect interpolant sequences [2021-12-17 12:15:11,252 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2021-12-17 12:15:11,252 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 24 [2021-12-17 12:15:11,252 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888012350] [2021-12-17 12:15:11,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2021-12-17 12:15:11,253 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2021-12-17 12:15:11,253 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-17 12:15:11,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2021-12-17 12:15:11,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2021-12-17 12:15:11,255 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2021-12-17 12:15:11,697 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-17 12:15:11,697 INFO L93 Difference]: Finished difference Result 201 states and 231 transitions. [2021-12-17 12:15:11,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2021-12-17 12:15:11,701 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) Word has length 109 [2021-12-17 12:15:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-12-17 12:15:11,703 INFO L225 Difference]: With dead ends: 201 [2021-12-17 12:15:11,703 INFO L226 Difference]: Without dead ends: 196 [2021-12-17 12:15:11,704 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 193 SyntacticMatches, 1 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 237 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=665, Invalid=1141, Unknown=0, NotChecked=0, Total=1806 [2021-12-17 12:15:11,705 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 187 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 157 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2021-12-17 12:15:11,705 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 216 Invalid, 157 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2021-12-17 12:15:11,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2021-12-17 12:15:11,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2021-12-17 12:15:11,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 196 states, 151 states have (on average 1.1390728476821192) internal successors, (172), 151 states have internal predecessors, (172), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2021-12-17 12:15:11,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 217 transitions. [2021-12-17 12:15:11,743 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 217 transitions. Word has length 109 [2021-12-17 12:15:11,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-12-17 12:15:11,745 INFO L470 AbstractCegarLoop]: Abstraction has 196 states and 217 transitions. [2021-12-17 12:15:11,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 5.333333333333333) internal successors, (128), 24 states have internal predecessors, (128), 21 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 20 states have call predecessors, (24), 20 states have call successors, (24) [2021-12-17 12:15:11,746 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 217 transitions. [2021-12-17 12:15:11,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 200 [2021-12-17 12:15:11,751 INFO L506 BasicCegarLoop]: Found error trace [2021-12-17 12:15:11,752 INFO L514 BasicCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-12-17 12:15:11,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2021-12-17 12:15:11,958 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:11,959 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2021-12-17 12:15:11,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-17 12:15:11,959 INFO L85 PathProgramCache]: Analyzing trace with hash 32762610, now seen corresponding path program 4 times [2021-12-17 12:15:11,959 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-17 12:15:11,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568327393] [2021-12-17 12:15:11,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-17 12:15:11,960 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-17 12:15:11,969 ERROR L247 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2021-12-17 12:15:11,970 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2018883288] [2021-12-17 12:15:11,970 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2021-12-17 12:15:11,970 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-12-17 12:15:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-17 12:15:11,971 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2021-12-17 12:15:11,975 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2021-12-17 12:15:12,187 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2021-12-17 12:15:12,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2021-12-17 12:15:12,187 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-17 12:15:12,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-17 12:15:12,640 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-17 12:15:12,640 INFO L628 BasicCegarLoop]: Counterexample is feasible [2021-12-17 12:15:12,641 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2021-12-17 12:15:12,651 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2021-12-17 12:15:12,842 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2021-12-17 12:15:12,845 INFO L732 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1] [2021-12-17 12:15:12,847 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-12-17 12:15:12,940 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 17.12 12:15:12 BoogieIcfgContainer [2021-12-17 12:15:12,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-12-17 12:15:12,941 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-12-17 12:15:12,941 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-12-17 12:15:12,942 INFO L275 PluginConnector]: Witness Printer initialized [2021-12-17 12:15:12,942 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 17.12 12:15:02" (3/4) ... [2021-12-17 12:15:12,943 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-12-17 12:15:13,041 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2021-12-17 12:15:13,041 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-12-17 12:15:13,042 INFO L158 Benchmark]: Toolchain (without parser) took 11319.03ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 66.3MB in the beginning and 80.8MB in the end (delta: -14.5MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2021-12-17 12:15:13,042 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-17 12:15:13,042 INFO L158 Benchmark]: CACSL2BoogieTranslator took 233.96ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 76.4MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 12:15:13,043 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.78ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 75.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 12:15:13,043 INFO L158 Benchmark]: Boogie Preprocessor took 33.04ms. Allocated memory is still 100.7MB. Free memory was 75.0MB in the beginning and 73.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-17 12:15:13,043 INFO L158 Benchmark]: RCFGBuilder took 271.92ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 64.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-17 12:15:13,044 INFO L158 Benchmark]: TraceAbstraction took 10646.21ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.1MB in the beginning and 90.2MB in the end (delta: -26.1MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. [2021-12-17 12:15:13,044 INFO L158 Benchmark]: Witness Printer took 100.01ms. Allocated memory is still 121.6MB. Free memory was 90.2MB in the beginning and 80.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2021-12-17 12:15:13,045 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 77.6MB. Free memory was 56.6MB in the beginning and 56.6MB in the end (delta: 21.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 233.96ms. Allocated memory is still 100.7MB. Free memory was 66.1MB in the beginning and 76.4MB in the end (delta: -10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.78ms. Allocated memory is still 100.7MB. Free memory was 76.4MB in the beginning and 75.0MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 33.04ms. Allocated memory is still 100.7MB. Free memory was 75.0MB in the beginning and 73.9MB in the end (delta: 1.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 271.92ms. Allocated memory is still 100.7MB. Free memory was 73.9MB in the beginning and 64.6MB in the end (delta: 9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 10646.21ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.1MB in the beginning and 90.2MB in the end (delta: -26.1MB). Peak memory consumption was 50.2MB. Max. memory is 16.1GB. * Witness Printer took 100.01ms. Allocated memory is still 121.6MB. Free memory was 90.2MB in the beginning and 80.8MB in the end (delta: 9.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; VAL [counter=0] [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) VAL [A=123298817, counter=0, R=11105] [L28] CALL assume_abort_if_not(A % 2 == 1) VAL [\old(cond)=1, counter=0] [L9] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1, counter=0] [L28] RET assume_abort_if_not(A % 2 == 1) VAL [A=123298817, counter=0, R=11105] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=123298817, counter=0, r=22208, R=11105, u=22211, v=1] [L34] EXPR counter++ VAL [A=123298817, counter=1, counter++=0, R=11105, r=22208, u=22211, v=1] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=1] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=1] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=1, r=22208, R=11105, u=22211, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=1, R=11105, r=22208, u=22211, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=1, r=22207, R=11105, u=22211, v=3] [L34] EXPR counter++ VAL [A=123298817, counter=2, counter++=1, r=22207, R=11105, u=22211, v=3] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=2] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=2] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=2, r=22207, R=11105, u=22211, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=2, r=22207, R=11105, u=22211, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=2, r=22204, R=11105, u=22211, v=5] [L34] EXPR counter++ VAL [A=123298817, counter=3, counter++=2, R=11105, r=22204, u=22211, v=5] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=3] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=3] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=3, R=11105, r=22204, u=22211, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=3, r=22204, R=11105, u=22211, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=3, R=11105, r=22199, u=22211, v=7] [L34] EXPR counter++ VAL [A=123298817, counter=4, counter++=3, R=11105, r=22199, u=22211, v=7] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=4] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=4] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=4, R=11105, r=22199, u=22211, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=4, r=22199, R=11105, u=22211, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=4, R=11105, r=22192, u=22211, v=9] [L34] EXPR counter++ VAL [A=123298817, counter=5, counter++=4, R=11105, r=22192, u=22211, v=9] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=5] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=5] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=5, r=22192, R=11105, u=22211, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=5, R=11105, r=22192, u=22211, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=5, r=22183, R=11105, u=22211, v=11] [L34] EXPR counter++ VAL [A=123298817, counter=6, counter++=5, R=11105, r=22183, u=22211, v=11] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=6] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=6] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=6, r=22183, R=11105, u=22211, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=6, R=11105, r=22183, u=22211, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=6, R=11105, r=22172, u=22211, v=13] [L34] EXPR counter++ VAL [A=123298817, counter=7, counter++=6, r=22172, R=11105, u=22211, v=13] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=7] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=7] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=7, r=22172, R=11105, u=22211, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=7, r=22172, R=11105, u=22211, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=7, R=11105, r=22159, u=22211, v=15] [L34] EXPR counter++ VAL [A=123298817, counter=8, counter++=7, r=22159, R=11105, u=22211, v=15] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=8] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=8] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=8, R=11105, r=22159, u=22211, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=8, R=11105, r=22159, u=22211, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=8, R=11105, r=22144, u=22211, v=17] [L34] EXPR counter++ VAL [A=123298817, counter=9, counter++=8, r=22144, R=11105, u=22211, v=17] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=9] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=9] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=9, R=11105, r=22144, u=22211, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=9, r=22144, R=11105, u=22211, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=9, R=11105, r=22127, u=22211, v=19] [L34] EXPR counter++ VAL [A=123298817, counter=10, counter++=9, r=22127, R=11105, u=22211, v=19] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=10] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=10] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=10, R=11105, r=22127, u=22211, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=10, R=11105, r=22127, u=22211, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=10, R=11105, r=22108, u=22211, v=21] [L34] EXPR counter++ VAL [A=123298817, counter=11, counter++=10, r=22108, R=11105, u=22211, v=21] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=11, r=22108, R=11105, u=22211, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=11, R=11105, r=22108, u=22211, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=11, R=11105, r=22087, u=22211, v=23] [L34] EXPR counter++ VAL [A=123298817, counter=12, counter++=11, R=11105, r=22087, u=22211, v=23] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=12, R=11105, r=22087, u=22211, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=12, r=22087, R=11105, u=22211, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=12, R=11105, r=22064, u=22211, v=25] [L34] EXPR counter++ VAL [A=123298817, counter=13, counter++=12, R=11105, r=22064, u=22211, v=25] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=13, R=11105, r=22064, u=22211, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=13, R=11105, r=22064, u=22211, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=13, R=11105, r=22039, u=22211, v=27] [L34] EXPR counter++ VAL [A=123298817, counter=14, counter++=13, R=11105, r=22039, u=22211, v=27] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=14, R=11105, r=22039, u=22211, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=14, R=11105, r=22039, u=22211, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=14, r=22012, R=11105, u=22211, v=29] [L34] EXPR counter++ VAL [A=123298817, counter=15, counter++=14, R=11105, r=22012, u=22211, v=29] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=15, R=11105, r=22012, u=22211, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=15, R=11105, r=22012, u=22211, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=15, r=21983, R=11105, u=22211, v=31] [L34] EXPR counter++ VAL [A=123298817, counter=16, counter++=15, r=21983, R=11105, u=22211, v=31] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=16, R=11105, r=21983, u=22211, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=16, r=21983, R=11105, u=22211, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=16, R=11105, r=21952, u=22211, v=33] [L34] EXPR counter++ VAL [A=123298817, counter=17, counter++=16, r=21952, R=11105, u=22211, v=33] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=17, r=21952, R=11105, u=22211, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=17, R=11105, r=21952, u=22211, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=17, R=11105, r=21919, u=22211, v=35] [L34] EXPR counter++ VAL [A=123298817, counter=18, counter++=17, r=21919, R=11105, u=22211, v=35] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=18, R=11105, r=21919, u=22211, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=18, R=11105, r=21919, u=22211, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=18, r=21884, R=11105, u=22211, v=37] [L34] EXPR counter++ VAL [A=123298817, counter=19, counter++=18, r=21884, R=11105, u=22211, v=37] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=19, R=11105, r=21884, u=22211, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=19, r=21884, R=11105, u=22211, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=19, r=21847, R=11105, u=22211, v=39] [L34] EXPR counter++ VAL [A=123298817, counter=20, counter++=19, R=11105, r=21847, u=22211, v=39] [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=123298817, counter=20, R=11105, r=21847, u=22211, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=123298817, counter=20, R=11105, r=21847, u=22211, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=123298817, counter=20, R=11105, r=21808, u=22211, v=41] [L34] EXPR counter++ VAL [A=123298817, counter=21, counter++=20, R=11105, r=21808, u=22211, v=41] [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=21] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=21] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=21] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 8, TraceHistogramMax: 21, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 362 SdHoareTripleChecker+Valid, 2.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 682 SdHoareTripleChecker+Invalid, 2.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 497 mSDsCounter, 119 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 266 IncrementalHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 119 mSolverCounterUnsat, 185 mSDtfsCounter, 266 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 514 GetRequests, 423 SyntacticMatches, 3 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=7, InterpolantAutomatonStates: 93, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 8 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 3.0s SatisfiabilityAnalysisTime, 1.8s InterpolantComputationTime, 472 NumberOfCodeBlocks, 472 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 479 ConstructedInterpolants, 0 QuantifiedInterpolants, 1243 SizeOfPredicates, 24 NumberOfNonLiveVariables, 790 ConjunctsInSsa, 62 ConjunctsInUnsatCore, 11 InterpolantComputations, 3 PerfectInterpolantSequences, 310/1086 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-12-17 12:15:13,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE