./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f4b24e32 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_unwindbound10.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 96b71e4fe20331af08d1b5394215c6ca1c246124118142d0900823a256b0e31d --- Real Ultimate output --- This is Ultimate 0.2.2-?-f4b24e3 [2022-07-13 16:28:49,945 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-13 16:28:49,947 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-13 16:28:49,966 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-13 16:28:49,967 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-13 16:28:49,967 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-13 16:28:49,973 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-13 16:28:49,974 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-13 16:28:49,978 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-13 16:28:49,979 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-13 16:28:49,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-13 16:28:49,980 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-13 16:28:49,981 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-13 16:28:49,983 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-13 16:28:49,984 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-13 16:28:49,986 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-13 16:28:49,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-13 16:28:49,988 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-13 16:28:49,992 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-13 16:28:49,994 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-13 16:28:49,995 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-13 16:28:49,998 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-13 16:28:49,999 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-13 16:28:50,000 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-13 16:28:50,000 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-13 16:28:50,002 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-13 16:28:50,005 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-13 16:28:50,006 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-13 16:28:50,006 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-13 16:28:50,007 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-13 16:28:50,007 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-13 16:28:50,008 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-13 16:28:50,009 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-13 16:28:50,010 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-13 16:28:50,010 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-13 16:28:50,011 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-13 16:28:50,011 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-13 16:28:50,012 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-13 16:28:50,012 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-13 16:28:50,012 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-13 16:28:50,012 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-13 16:28:50,013 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-13 16:28:50,015 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-13 16:28:50,033 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-13 16:28:50,033 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-13 16:28:50,033 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-13 16:28:50,034 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-13 16:28:50,034 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-13 16:28:50,034 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-13 16:28:50,035 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-13 16:28:50,035 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-13 16:28:50,035 INFO L138 SettingsManager]: * Use SBE=true [2022-07-13 16:28:50,035 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-13 16:28:50,035 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-13 16:28:50,036 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-13 16:28:50,036 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-13 16:28:50,036 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-13 16:28:50,036 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-13 16:28:50,036 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-13 16:28:50,036 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-13 16:28:50,036 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-13 16:28:50,037 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-13 16:28:50,037 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-13 16:28:50,037 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-13 16:28:50,037 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-13 16:28:50,037 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-13 16:28:50,037 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-13 16:28:50,037 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:28:50,038 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-13 16:28:50,038 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-13 16:28:50,038 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-13 16:28:50,038 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-13 16:28:50,038 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-13 16:28:50,039 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-13 16:28:50,039 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-13 16:28:50,039 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-13 16:28:50,039 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 -> 96b71e4fe20331af08d1b5394215c6ca1c246124118142d0900823a256b0e31d [2022-07-13 16:28:50,229 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-13 16:28:50,248 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-13 16:28:50,249 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-13 16:28:50,250 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-13 16:28:50,250 INFO L275 PluginConnector]: CDTParser initialized [2022-07-13 16:28:50,251 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2022-07-13 16:28:50,295 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a996fb4f5/fe845c1bf2ec4c9c9ddfedb007f1dc43/FLAG90d68b603 [2022-07-13 16:28:50,605 INFO L306 CDTParser]: Found 1 translation units. [2022-07-13 16:28:50,605 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound10.c [2022-07-13 16:28:50,609 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a996fb4f5/fe845c1bf2ec4c9c9ddfedb007f1dc43/FLAG90d68b603 [2022-07-13 16:28:51,017 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a996fb4f5/fe845c1bf2ec4c9c9ddfedb007f1dc43 [2022-07-13 16:28:51,019 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-13 16:28:51,022 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-13 16:28:51,023 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-13 16:28:51,023 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-13 16:28:51,025 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-13 16:28:51,026 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,028 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e1e4986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51, skipping insertion in model container [2022-07-13 16:28:51,028 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,032 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-13 16:28:51,043 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-13 16:28:51,162 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_unwindbound10.c[524,537] [2022-07-13 16:28:51,177 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:28:51,184 INFO L203 MainTranslator]: Completed pre-run [2022-07-13 16:28:51,195 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_unwindbound10.c[524,537] [2022-07-13 16:28:51,212 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-13 16:28:51,222 INFO L208 MainTranslator]: Completed translation [2022-07-13 16:28:51,222 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51 WrapperNode [2022-07-13 16:28:51,222 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-13 16:28:51,223 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-13 16:28:51,223 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-13 16:28:51,224 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-13 16:28:51,229 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,234 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,249 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-07-13 16:28:51,249 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-13 16:28:51,250 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-13 16:28:51,250 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-13 16:28:51,250 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-13 16:28:51,256 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,256 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,271 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,275 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,279 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,280 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-13 16:28:51,281 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-13 16:28:51,281 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-13 16:28:51,282 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-13 16:28:51,282 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (1/1) ... [2022-07-13 16:28:51,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-13 16:28:51,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:51,304 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-07-13 16:28:51,346 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-07-13 16:28:51,359 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-13 16:28:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-07-13 16:28:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-07-13 16:28:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-13 16:28:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-13 16:28:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-13 16:28:51,360 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-07-13 16:28:51,360 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-07-13 16:28:51,402 INFO L234 CfgBuilder]: Building ICFG [2022-07-13 16:28:51,404 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-13 16:28:51,529 INFO L275 CfgBuilder]: Performing block encoding [2022-07-13 16:28:51,533 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-13 16:28:51,534 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-07-13 16:28:51,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:28:51 BoogieIcfgContainer [2022-07-13 16:28:51,535 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-13 16:28:51,536 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-13 16:28:51,536 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-13 16:28:51,539 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-13 16:28:51,539 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.07 04:28:51" (1/3) ... [2022-07-13 16:28:51,540 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6da449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:28:51, skipping insertion in model container [2022-07-13 16:28:51,549 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.07 04:28:51" (2/3) ... [2022-07-13 16:28:51,549 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7a6da449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.07 04:28:51, skipping insertion in model container [2022-07-13 16:28:51,550 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:28:51" (3/3) ... [2022-07-13 16:28:51,551 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound10.c [2022-07-13 16:28:51,560 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-13 16:28:51,575 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-13 16:28:51,618 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-13 16:28:51,623 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@70efd036, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4c94aa3b [2022-07-13 16:28:51,624 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-13 16:28:51,626 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) [2022-07-13 16:28:51,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-07-13 16:28:51,633 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:28:51,633 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:28:51,634 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:28:51,637 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:28:51,637 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-07-13 16:28:51,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:28:51,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [206218242] [2022-07-13 16:28:51,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:51,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:28:51,725 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:28:51,727 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1799095956] [2022-07-13 16:28:51,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:51,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:51,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:51,729 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:28:51,761 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-07-13 16:28:51,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:28:51,819 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-07-13 16:28:51,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:28:51,853 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-13 16:28:51,853 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:28:51,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:28:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [206218242] [2022-07-13 16:28:51,854 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:28:51,854 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1799095956] [2022-07-13 16:28:51,855 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1799095956] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:28:51,855 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:28:51,855 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-13 16:28:51,856 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280992785] [2022-07-13 16:28:51,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:28:51,859 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-13 16:28:51,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:28:51,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-13 16:28:51,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-13 16:28:51,887 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) [2022-07-13 16:28:51,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:28:51,902 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-07-13 16:28:51,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-13 16:28:51,904 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 [2022-07-13 16:28:51,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:28:51,908 INFO L225 Difference]: With dead ends: 47 [2022-07-13 16:28:51,908 INFO L226 Difference]: Without dead ends: 21 [2022-07-13 16:28:51,910 INFO L412 NwaCegarLoop]: 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 [2022-07-13 16:28:51,913 INFO L413 NwaCegarLoop]: 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 [2022-07-13 16:28:51,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:28:51,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-07-13 16:28:51,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-07-13 16:28:51,935 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) [2022-07-13 16:28:51,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-07-13 16:28:51,936 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-07-13 16:28:51,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:28:51,937 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-07-13 16:28:51,937 INFO L496 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) [2022-07-13 16:28:51,937 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-07-13 16:28:51,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 16:28:51,938 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:28:51,938 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:28:51,955 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-07-13 16:28:52,154 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-07-13 16:28:52,155 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:28:52,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:28:52,155 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-07-13 16:28:52,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:28:52,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [479955270] [2022-07-13 16:28:52,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:52,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:28:52,163 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:28:52,163 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [620274023] [2022-07-13 16:28:52,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:52,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:52,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:52,173 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:28:52,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-07-13 16:28:52,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:28:52,227 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-07-13 16:28:52,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:28:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:28:52,287 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:28:52,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:28:52,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [479955270] [2022-07-13 16:28:52,289 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:28:52,289 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [620274023] [2022-07-13 16:28:52,290 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [620274023] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:28:52,291 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:28:52,291 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-07-13 16:28:52,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971205222] [2022-07-13 16:28:52,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:28:52,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-13 16:28:52,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:28:52,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-13 16:28:52,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-07-13 16:28:52,295 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) [2022-07-13 16:28:52,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:28:52,309 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-07-13 16:28:52,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-13 16:28:52,312 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 [2022-07-13 16:28:52,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:28:52,313 INFO L225 Difference]: With dead ends: 30 [2022-07-13 16:28:52,314 INFO L226 Difference]: Without dead ends: 23 [2022-07-13 16:28:52,314 INFO L412 NwaCegarLoop]: 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 [2022-07-13 16:28:52,316 INFO L413 NwaCegarLoop]: 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 [2022-07-13 16:28:52,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 57 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:28:52,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-07-13 16:28:52,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-07-13 16:28:52,323 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) [2022-07-13 16:28:52,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-07-13 16:28:52,325 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-07-13 16:28:52,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:28:52,326 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-07-13 16:28:52,327 INFO L496 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) [2022-07-13 16:28:52,327 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-07-13 16:28:52,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-07-13 16:28:52,328 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:28:52,328 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:28:52,351 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-07-13 16:28:52,544 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-07-13 16:28:52,547 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:28:52,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:28:52,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-07-13 16:28:52,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:28:52,548 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094270970] [2022-07-13 16:28:52,548 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:52,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:28:52,557 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:28:52,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [808955878] [2022-07-13 16:28:52,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:52,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:52,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:52,561 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-13 16:28:52,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-07-13 16:28:52,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:28:52,594 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 9 conjunts are in the unsatisfiable core [2022-07-13 16:28:52,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:28:52,818 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:28:52,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-07-13 16:28:52,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:28:52,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094270970] [2022-07-13 16:28:52,819 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:28:52,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [808955878] [2022-07-13 16:28:52,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [808955878] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-13 16:28:52,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-13 16:28:52,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-07-13 16:28:52,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403020315] [2022-07-13 16:28:52,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-13 16:28:52,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-07-13 16:28:52,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:28:52,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-07-13 16:28:52,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-07-13 16:28:52,821 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) [2022-07-13 16:28:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:28:54,465 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-07-13 16:28:54,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-07-13 16:28:54,466 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 [2022-07-13 16:28:54,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:28:54,467 INFO L225 Difference]: With dead ends: 35 [2022-07-13 16:28:54,467 INFO L226 Difference]: Without dead ends: 33 [2022-07-13 16:28:54,467 INFO L412 NwaCegarLoop]: 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 [2022-07-13 16:28:54,468 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 8 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-07-13 16:28:54,468 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 69 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-07-13 16:28:54,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-07-13 16:28:54,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-07-13 16:28:54,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 23 states have (on average 1.3043478260869565) internal successors, (30), 24 states have internal predecessors, (30), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-07-13 16:28:54,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-07-13 16:28:54,473 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2022-07-13 16:28:54,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:28:54,473 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-07-13 16:28:54,473 INFO L496 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) [2022-07-13 16:28:54,474 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-07-13 16:28:54,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-07-13 16:28:54,474 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:28:54,474 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-13 16:28:54,499 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-13 16:28:54,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:54,675 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:28:54,675 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:28:54,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-07-13 16:28:54,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:28:54,676 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59704505] [2022-07-13 16:28:54,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:54,676 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:28:54,682 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:28:54,682 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1198412330] [2022-07-13 16:28:54,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:54,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:54,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:54,684 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) [2022-07-13 16:28:54,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-07-13 16:28:54,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:28:54,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-13 16:28:54,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:28:54,780 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:28:54,780 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:28:54,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:28:54,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:28:54,893 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59704505] [2022-07-13 16:28:54,893 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:28:54,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198412330] [2022-07-13 16:28:54,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198412330] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:28:54,894 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:28:54,894 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-07-13 16:28:54,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1421867350] [2022-07-13 16:28:54,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:28:54,895 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-07-13 16:28:54,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:28:54,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-07-13 16:28:54,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-07-13 16:28:54,896 INFO L87 Difference]: Start difference. First operand 32 states and 39 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) [2022-07-13 16:28:55,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:28:55,013 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-07-13 16:28:55,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-07-13 16:28:55,013 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 [2022-07-13 16:28:55,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:28:55,016 INFO L225 Difference]: With dead ends: 39 [2022-07-13 16:28:55,019 INFO L226 Difference]: Without dead ends: 34 [2022-07-13 16:28:55,020 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-07-13 16:28:55,027 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 16 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:28:55,027 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 114 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:28:55,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-07-13 16:28:55,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-07-13 16:28:55,035 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) [2022-07-13 16:28:55,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-07-13 16:28:55,036 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2022-07-13 16:28:55,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:28:55,036 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-07-13 16:28:55,036 INFO L496 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) [2022-07-13 16:28:55,036 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-07-13 16:28:55,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-07-13 16:28:55,037 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:28:55,037 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:28:55,053 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-07-13 16:28:55,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:55,243 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:28:55,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:28:55,244 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-07-13 16:28:55,244 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:28:55,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193297479] [2022-07-13 16:28:55,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:55,244 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:28:55,250 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:28:55,250 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [35078984] [2022-07-13 16:28:55,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:55,251 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:55,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:55,252 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) [2022-07-13 16:28:55,263 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-07-13 16:28:55,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-13 16:28:55,284 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-07-13 16:28:55,285 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:28:55,339 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:28:55,340 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:28:55,378 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:28:55,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:28:55,378 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193297479] [2022-07-13 16:28:55,378 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:28:55,379 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35078984] [2022-07-13 16:28:55,379 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35078984] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:28:55,379 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:28:55,379 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-07-13 16:28:55,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1200306743] [2022-07-13 16:28:55,379 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:28:55,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-07-13 16:28:55,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:28:55,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-07-13 16:28:55,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-07-13 16:28:55,381 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) [2022-07-13 16:28:55,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:28:55,449 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-07-13 16:28:55,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-07-13 16:28:55,449 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 [2022-07-13 16:28:55,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:28:55,451 INFO L225 Difference]: With dead ends: 57 [2022-07-13 16:28:55,451 INFO L226 Difference]: Without dead ends: 52 [2022-07-13 16:28:55,452 INFO L412 NwaCegarLoop]: 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 [2022-07-13 16:28:55,453 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 28 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-13 16:28:55,454 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 106 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-13 16:28:55,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-07-13 16:28:55,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-07-13 16:28:55,471 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) [2022-07-13 16:28:55,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-07-13 16:28:55,472 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2022-07-13 16:28:55,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:28:55,472 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-07-13 16:28:55,472 INFO L496 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) [2022-07-13 16:28:55,472 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-07-13 16:28:55,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-07-13 16:28:55,473 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:28:55,474 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:28:55,491 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-07-13 16:28:55,682 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:55,682 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:28:55,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:28:55,683 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2022-07-13 16:28:55,683 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:28:55,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709536040] [2022-07-13 16:28:55,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:55,683 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:28:55,689 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:28:55,690 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [378384839] [2022-07-13 16:28:55,690 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-13 16:28:55,690 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:55,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:55,691 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) [2022-07-13 16:28:55,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-07-13 16:28:55,732 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-13 16:28:55,732 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-13 16:28:55,733 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-07-13 16:28:55,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-13 16:28:55,825 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-07-13 16:28:55,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-13 16:28:55,924 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-07-13 16:28:55,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-13 16:28:55,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709536040] [2022-07-13 16:28:55,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-13 16:28:55,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378384839] [2022-07-13 16:28:55,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378384839] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-13 16:28:55,926 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-13 16:28:55,926 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-07-13 16:28:55,926 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1718537823] [2022-07-13 16:28:55,926 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-13 16:28:55,927 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-07-13 16:28:55,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-13 16:28:55,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-07-13 16:28:55,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-07-13 16:28:55,928 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) [2022-07-13 16:28:56,072 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-13 16:28:56,072 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-07-13 16:28:56,072 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-07-13 16:28:56,074 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 [2022-07-13 16:28:56,075 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-13 16:28:56,078 INFO L225 Difference]: With dead ends: 111 [2022-07-13 16:28:56,078 INFO L226 Difference]: Without dead ends: 106 [2022-07-13 16:28:56,079 INFO L412 NwaCegarLoop]: 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 [2022-07-13 16:28:56,080 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 115 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 46 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 46 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-13 16:28:56,081 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 131 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [46 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-13 16:28:56,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-07-13 16:28:56,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-07-13 16:28:56,102 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) [2022-07-13 16:28:56,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-07-13 16:28:56,103 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2022-07-13 16:28:56,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-13 16:28:56,103 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-07-13 16:28:56,103 INFO L496 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) [2022-07-13 16:28:56,104 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-07-13 16:28:56,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-07-13 16:28:56,105 INFO L187 NwaCegarLoop]: Found error trace [2022-07-13 16:28:56,105 INFO L195 NwaCegarLoop]: 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] [2022-07-13 16:28:56,123 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-07-13 16:28:56,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:56,321 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-13 16:28:56,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-13 16:28:56,324 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2022-07-13 16:28:56,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-13 16:28:56,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083451059] [2022-07-13 16:28:56,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-13 16:28:56,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-13 16:28:56,337 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-13 16:28:56,338 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1544248782] [2022-07-13 16:28:56,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-13 16:28:56,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:56,338 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-13 16:28:56,339 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) [2022-07-13 16:28:56,340 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-13 16:28:59,618 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-07-13 16:28:59,618 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-07-13 16:28:59,618 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-07-13 16:28:59,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-07-13 16:28:59,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-07-13 16:28:59,698 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-07-13 16:28:59,699 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-07-13 16:28:59,731 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-07-13 16:28:59,906 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-13 16:28:59,909 INFO L356 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1] [2022-07-13 16:28:59,911 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-07-13 16:28:59,950 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 13.07 04:28:59 BoogieIcfgContainer [2022-07-13 16:28:59,950 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-07-13 16:28:59,950 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-07-13 16:28:59,950 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-07-13 16:28:59,951 INFO L275 PluginConnector]: Witness Printer initialized [2022-07-13 16:28:59,951 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.07 04:28:51" (3/4) ... [2022-07-13 16:28:59,952 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-07-13 16:29:00,014 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-07-13 16:29:00,014 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-07-13 16:29:00,015 INFO L158 Benchmark]: Toolchain (without parser) took 8992.64ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 81.0MB in the beginning and 107.7MB in the end (delta: -26.6MB). Peak memory consumption was 5.1MB. Max. memory is 16.1GB. [2022-07-13 16:29:00,015 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:00,015 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.88ms. Allocated memory is still 111.1MB. Free memory was 80.8MB in the beginning and 85.8MB in the end (delta: -5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-07-13 16:29:00,015 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.03ms. Allocated memory is still 111.1MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-07-13 16:29:00,015 INFO L158 Benchmark]: Boogie Preprocessor took 30.04ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 935.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-07-13 16:29:00,016 INFO L158 Benchmark]: RCFGBuilder took 254.31ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 73.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-07-13 16:29:00,016 INFO L158 Benchmark]: TraceAbstraction took 8413.90ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 73.0MB in the beginning and 111.9MB in the end (delta: -38.9MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. [2022-07-13 16:29:00,016 INFO L158 Benchmark]: Witness Printer took 63.78ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 107.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-07-13 16:29:00,017 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.17ms. Allocated memory is still 111.1MB. Free memory is still 66.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.88ms. Allocated memory is still 111.1MB. Free memory was 80.8MB in the beginning and 85.8MB in the end (delta: -5.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.03ms. Allocated memory is still 111.1MB. Free memory was 85.8MB in the beginning and 84.3MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 30.04ms. Allocated memory is still 111.1MB. Free memory was 84.3MB in the beginning and 83.3MB in the end (delta: 935.2kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 254.31ms. Allocated memory is still 111.1MB. Free memory was 83.3MB in the beginning and 73.4MB in the end (delta: 9.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 8413.90ms. Allocated memory was 111.1MB in the beginning and 142.6MB in the end (delta: 31.5MB). Free memory was 73.0MB in the beginning and 111.9MB in the end (delta: -38.9MB). Peak memory consumption was 69.9MB. Max. memory is 16.1GB. * Witness Printer took 63.78ms. Allocated memory is still 142.6MB. Free memory was 111.9MB in the beginning and 107.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. 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=2603, counter=0, R=52] [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=2603, counter=0, R=52] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=2603, counter=0, R=52, r=101, u=105, v=1] [L34] EXPR counter++ VAL [A=2603, counter=1, counter++=0, r=101, R=52, u=105, v=1] [L34] COND TRUE counter++<10 [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=2603, counter=1, r=101, R=52, u=105, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=1, r=101, R=52, u=105, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=1, R=52, r=100, u=105, v=3] [L34] EXPR counter++ VAL [A=2603, counter=2, counter++=1, r=100, R=52, u=105, v=3] [L34] COND TRUE counter++<10 [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=2603, counter=2, R=52, r=100, u=105, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=2, r=100, R=52, u=105, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=2, r=97, R=52, u=105, v=5] [L34] EXPR counter++ VAL [A=2603, counter=3, counter++=2, r=97, R=52, u=105, v=5] [L34] COND TRUE counter++<10 [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=2603, counter=3, r=97, R=52, u=105, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=3, r=97, R=52, u=105, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=3, R=52, r=92, u=105, v=7] [L34] EXPR counter++ VAL [A=2603, counter=4, counter++=3, R=52, r=92, u=105, v=7] [L34] COND TRUE counter++<10 [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=2603, counter=4, r=92, R=52, u=105, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=4, r=92, R=52, u=105, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=4, r=85, R=52, u=105, v=9] [L34] EXPR counter++ VAL [A=2603, counter=5, counter++=4, R=52, r=85, u=105, v=9] [L34] COND TRUE counter++<10 [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=2603, counter=5, r=85, R=52, u=105, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=5, r=85, R=52, u=105, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=5, r=76, R=52, u=105, v=11] [L34] EXPR counter++ VAL [A=2603, counter=6, counter++=5, r=76, R=52, u=105, v=11] [L34] COND TRUE counter++<10 [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=2603, counter=6, r=76, R=52, u=105, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=6, r=76, R=52, u=105, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=6, r=65, R=52, u=105, v=13] [L34] EXPR counter++ VAL [A=2603, counter=7, counter++=6, r=65, R=52, u=105, v=13] [L34] COND TRUE counter++<10 [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=2603, counter=7, R=52, r=65, u=105, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=7, r=65, R=52, u=105, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=7, R=52, r=52, u=105, v=15] [L34] EXPR counter++ VAL [A=2603, counter=8, counter++=7, R=52, r=52, u=105, v=15] [L34] COND TRUE counter++<10 [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=2603, counter=8, R=52, r=52, u=105, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=8, r=52, R=52, u=105, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=8, r=37, R=52, u=105, v=17] [L34] EXPR counter++ VAL [A=2603, counter=9, counter++=8, r=37, R=52, u=105, v=17] [L34] COND TRUE counter++<10 [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=2603, counter=9, R=52, r=37, u=105, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=9, R=52, r=37, u=105, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=9, r=20, R=52, u=105, v=19] [L34] EXPR counter++ VAL [A=2603, counter=10, counter++=9, r=20, R=52, u=105, v=19] [L34] COND TRUE counter++<10 [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=2603, counter=10, r=20, R=52, u=105, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=2603, counter=10, R=52, r=20, u=105, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=2603, counter=10, r=1, R=52, u=105, v=21] [L34] EXPR counter++ VAL [A=2603, counter=11, counter++=10, R=52, r=1, u=105, v=21] [L34] COND FALSE !(counter++<10) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=11] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=11] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=11] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 7, TraceHistogramMax: 11, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 2.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 168 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 167 mSDsluCounter, 506 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 361 mSDsCounter, 65 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 199 IncrementalHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 65 mSolverCounterUnsat, 145 mSDtfsCounter, 199 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 279 GetRequests, 231 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=106occurred in iteration=6, InterpolantAutomatonStates: 51, 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, 6 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 3.4s SatisfiabilityAnalysisTime, 0.8s InterpolantComputationTime, 273 NumberOfCodeBlocks, 273 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 263 ConstructedInterpolants, 0 QuantifiedInterpolants, 701 SizeOfPredicates, 14 NumberOfNonLiveVariables, 521 ConjunctsInSsa, 39 ConjunctsInUnsatCore, 9 InterpolantComputations, 3 PerfectInterpolantSequences, 82/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-07-13 16:29:00,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- 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