./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 38b53e6a Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/config/AutomizerReach.xml -i ../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R --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 a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-38b53e6 [2022-11-25 17:18:41,899 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-25 17:18:41,901 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-25 17:18:41,932 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-25 17:18:41,933 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-25 17:18:41,934 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-25 17:18:41,936 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-25 17:18:41,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-25 17:18:41,939 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-25 17:18:41,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-25 17:18:41,942 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-25 17:18:41,943 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-25 17:18:41,943 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-25 17:18:41,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-25 17:18:41,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-25 17:18:41,949 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-25 17:18:41,950 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-25 17:18:41,951 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-25 17:18:41,953 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-25 17:18:41,955 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-25 17:18:41,963 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-25 17:18:41,965 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-25 17:18:41,966 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-25 17:18:41,967 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-25 17:18:41,970 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-25 17:18:41,971 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-25 17:18:41,971 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-25 17:18:41,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-25 17:18:41,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-25 17:18:41,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-25 17:18:41,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-25 17:18:41,975 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-25 17:18:41,976 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-25 17:18:41,977 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-25 17:18:41,978 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-25 17:18:41,978 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-25 17:18:41,979 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-25 17:18:41,979 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-25 17:18:41,980 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-25 17:18:41,981 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-25 17:18:41,982 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-25 17:18:41,982 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-25 17:18:42,004 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-25 17:18:42,005 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-25 17:18:42,005 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-25 17:18:42,006 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-25 17:18:42,006 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-25 17:18:42,007 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-25 17:18:42,007 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-25 17:18:42,008 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-25 17:18:42,008 INFO L138 SettingsManager]: * Use SBE=true [2022-11-25 17:18:42,008 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-25 17:18:42,009 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-25 17:18:42,009 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-25 17:18:42,009 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-25 17:18:42,009 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-25 17:18:42,010 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-25 17:18:42,010 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-25 17:18:42,010 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-25 17:18:42,011 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-25 17:18:42,011 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-25 17:18:42,011 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-25 17:18:42,011 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-25 17:18:42,012 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-25 17:18:42,012 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-25 17:18:42,012 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-25 17:18:42,013 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:18:42,013 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-25 17:18:42,013 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-25 17:18:42,013 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-25 17:18:42,014 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-25 17:18:42,014 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-25 17:18:42,014 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-25 17:18:42,015 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-25 17:18:42,015 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-11-25 17:18:42,015 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-25 17:18:42,015 INFO L138 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R 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 -> a367fffaabe322cc88315ee22f1c9c69606de0332ddd62ff36608ec1e5019dc8 [2022-11-25 17:18:42,310 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-25 17:18:42,334 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-25 17:18:42,338 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-25 17:18:42,339 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-25 17:18:42,340 INFO L275 PluginConnector]: CDTParser initialized [2022-11-25 17:18:42,341 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/../../sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-11-25 17:18:45,366 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-25 17:18:45,605 INFO L351 CDTParser]: Found 1 translation units. [2022-11-25 17:18:45,607 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c [2022-11-25 17:18:45,615 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/data/89d9c0625/eadb5bcbe8f849df9b4dc7ae97cb52ab/FLAGe67b69c8b [2022-11-25 17:18:45,639 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/data/89d9c0625/eadb5bcbe8f849df9b4dc7ae97cb52ab [2022-11-25 17:18:45,652 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-25 17:18:45,654 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-25 17:18:45,659 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-25 17:18:45,659 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-25 17:18:45,662 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-25 17:18:45,663 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:45,666 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@554d0cdb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45, skipping insertion in model container [2022-11-25 17:18:45,666 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:45,674 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-25 17:18:45,698 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-25 17:18:45,833 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2022-11-25 17:18:45,851 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:18:45,861 INFO L203 MainTranslator]: Completed pre-run [2022-11-25 17:18:45,894 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/sv-benchmarks/c/nla-digbench-scaling/fermat2-ll_unwindbound50.c[524,537] [2022-11-25 17:18:45,901 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-25 17:18:45,915 INFO L208 MainTranslator]: Completed translation [2022-11-25 17:18:45,916 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45 WrapperNode [2022-11-25 17:18:45,916 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-25 17:18:45,917 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-25 17:18:45,917 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-25 17:18:45,917 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-25 17:18:45,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:45,968 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:45,984 INFO L138 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 46 [2022-11-25 17:18:45,985 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-25 17:18:45,986 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-25 17:18:45,986 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-25 17:18:45,986 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-25 17:18:45,993 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:45,993 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:45,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:45,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:46,003 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:46,006 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:46,008 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:46,008 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:46,010 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-25 17:18:46,011 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-25 17:18:46,011 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-25 17:18:46,011 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-25 17:18:46,012 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (1/1) ... [2022-11-25 17:18:46,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-25 17:18:46,034 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:46,047 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-25 17:18:46,054 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-25 17:18:46,099 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-25 17:18:46,100 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-11-25 17:18:46,100 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-11-25 17:18:46,100 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-25 17:18:46,101 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-25 17:18:46,101 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-25 17:18:46,103 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-11-25 17:18:46,104 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-11-25 17:18:46,186 INFO L235 CfgBuilder]: Building ICFG [2022-11-25 17:18:46,189 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-25 17:18:46,398 INFO L276 CfgBuilder]: Performing block encoding [2022-11-25 17:18:46,418 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-25 17:18:46,418 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-25 17:18:46,423 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:18:46 BoogieIcfgContainer [2022-11-25 17:18:46,423 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-25 17:18:46,445 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-25 17:18:46,445 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-25 17:18:46,449 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-25 17:18:46,449 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.11 05:18:45" (1/3) ... [2022-11-25 17:18:46,450 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caacc0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:18:46, skipping insertion in model container [2022-11-25 17:18:46,450 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.11 05:18:45" (2/3) ... [2022-11-25 17:18:46,451 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4caacc0b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.11 05:18:46, skipping insertion in model container [2022-11-25 17:18:46,451 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:18:46" (3/3) ... [2022-11-25 17:18:46,452 INFO L112 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound50.c [2022-11-25 17:18:46,471 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-25 17:18:46,472 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-25 17:18:46,534 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-25 17:18:46,549 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@637466b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-25 17:18:46,562 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-25 17:18:46,573 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-11-25 17:18:46,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-25 17:18:46,582 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:46,583 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:46,583 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:46,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:46,588 INFO L85 PathProgramCache]: Analyzing trace with hash 1086166160, now seen corresponding path program 1 times [2022-11-25 17:18:46,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:46,597 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713833188] [2022-11-25 17:18:46,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:46,598 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:46,691 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:46,691 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1342687520] [2022-11-25 17:18:46,692 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:46,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:46,692 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:46,696 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:46,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-25 17:18:46,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:46,772 INFO L263 TraceCheckSpWp]: Trace formula consists of 65 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-25 17:18:46,776 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:46,810 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-25 17:18:46,811 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:46,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:46,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713833188] [2022-11-25 17:18:46,813 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:46,813 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1342687520] [2022-11-25 17:18:46,815 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1342687520] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:46,815 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:46,815 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-25 17:18:46,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1852645453] [2022-11-25 17:18:46,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:46,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-25 17:18:46,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:46,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-25 17:18:46,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-25 17:18:46,871 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-11-25 17:18:46,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:46,896 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-11-25 17:18:46,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-25 17:18:46,898 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-11-25 17:18:46,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:46,905 INFO L225 Difference]: With dead ends: 47 [2022-11-25 17:18:46,906 INFO L226 Difference]: Without dead ends: 21 [2022-11-25 17:18:46,909 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-11-25 17:18:46,914 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-11-25 17:18:46,916 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-11-25 17:18:46,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-11-25 17:18:46,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-11-25 17:18:46,957 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-11-25 17:18:46,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-11-25 17:18:46,961 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 18 [2022-11-25 17:18:46,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:46,962 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-11-25 17:18:46,962 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-11-25 17:18:46,963 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-11-25 17:18:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:18:46,966 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:46,966 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:46,978 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:47,173 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:47,173 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:47,174 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:47,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1345709874, now seen corresponding path program 1 times [2022-11-25 17:18:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:47,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438291691] [2022-11-25 17:18:47,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:47,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:47,190 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:47,190 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [700119535] [2022-11-25 17:18:47,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:47,191 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:47,191 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:47,192 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:47,198 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-25 17:18:47,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:47,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 3 conjunts are in the unsatisfiable core [2022-11-25 17:18:47,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:47,352 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:47,352 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:47,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:47,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438291691] [2022-11-25 17:18:47,353 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:47,353 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [700119535] [2022-11-25 17:18:47,354 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [700119535] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:47,354 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:47,354 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-25 17:18:47,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1236489454] [2022-11-25 17:18:47,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:47,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-25 17:18:47,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:47,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-25 17:18:47,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-25 17:18:47,357 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-11-25 17:18:47,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:47,374 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-11-25 17:18:47,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-25 17:18:47,374 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-11-25 17:18:47,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:47,375 INFO L225 Difference]: With dead ends: 30 [2022-11-25 17:18:47,376 INFO L226 Difference]: Without dead ends: 23 [2022-11-25 17:18:47,376 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-11-25 17:18:47,377 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-11-25 17:18:47,378 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-11-25 17:18:47,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-11-25 17:18:47,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-11-25 17:18:47,398 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-11-25 17:18:47,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-11-25 17:18:47,399 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 19 [2022-11-25 17:18:47,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:47,400 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-11-25 17:18:47,401 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-11-25 17:18:47,401 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-11-25 17:18:47,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-25 17:18:47,402 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:47,402 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:47,410 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:47,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:47,603 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:47,604 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:47,604 INFO L85 PathProgramCache]: Analyzing trace with hash 1347497334, now seen corresponding path program 1 times [2022-11-25 17:18:47,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:47,604 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291941242] [2022-11-25 17:18:47,604 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:47,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:47,628 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:47,631 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [912419083] [2022-11-25 17:18:47,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:47,631 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:47,632 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:47,633 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:47,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-25 17:18:47,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:47,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 17 conjunts are in the unsatisfiable core [2022-11-25 17:18:47,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:47,995 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-25 17:18:47,995 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-25 17:18:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:47,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291941242] [2022-11-25 17:18:47,996 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:48,010 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [912419083] [2022-11-25 17:18:48,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [912419083] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-25 17:18:48,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-25 17:18:48,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-25 17:18:48,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206597756] [2022-11-25 17:18:48,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-25 17:18:48,012 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:18:48,012 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:48,013 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:18:48,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:48,013 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:18:51,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-11-25 17:18:51,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:51,127 INFO L93 Difference]: Finished difference Result 35 states and 42 transitions. [2022-11-25 17:18:51,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:18:51,129 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-11-25 17:18:51,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:51,134 INFO L225 Difference]: With dead ends: 35 [2022-11-25 17:18:51,134 INFO L226 Difference]: Without dead ends: 33 [2022-11-25 17:18:51,137 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-25 17:18:51,138 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 18 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:51,144 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 79 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 3.1s Time] [2022-11-25 17:18:51,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-25 17:18:51,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 32. [2022-11-25 17:18:51,158 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-11-25 17:18:51,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 39 transitions. [2022-11-25 17:18:51,159 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 39 transitions. Word has length 19 [2022-11-25 17:18:51,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:51,160 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 39 transitions. [2022-11-25 17:18:51,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-11-25 17:18:51,160 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-11-25 17:18:51,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-25 17:18:51,161 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:51,161 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-11-25 17:18:51,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:51,372 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:51,373 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:51,373 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:51,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1636478750, now seen corresponding path program 1 times [2022-11-25 17:18:51,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:51,374 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323818929] [2022-11-25 17:18:51,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:51,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:51,385 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:51,386 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1937792800] [2022-11-25 17:18:51,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:51,386 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:51,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:51,388 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:51,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-25 17:18:51,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:51,450 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 13 conjunts are in the unsatisfiable core [2022-11-25 17:18:51,453 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:51,584 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:51,585 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:18:51,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:51,769 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323818929] [2022-11-25 17:18:51,769 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:51,769 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937792800] [2022-11-25 17:18:51,769 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937792800] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:18:51,769 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:18:51,770 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-11-25 17:18:51,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344020844] [2022-11-25 17:18:51,770 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:18:51,770 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-11-25 17:18:51,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:51,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-11-25 17:18:51,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-11-25 17:18:51,772 INFO L87 Difference]: Start difference. First operand 32 states and 39 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:18:51,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:51,961 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-11-25 17:18:51,962 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-25 17:18:51,963 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) Word has length 25 [2022-11-25 17:18:51,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:51,968 INFO L225 Difference]: With dead ends: 39 [2022-11-25 17:18:51,969 INFO L226 Difference]: Without dead ends: 34 [2022-11-25 17:18:51,969 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:18:51,970 INFO L413 NwaCegarLoop]: 17 mSDtfsCounter, 24 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:51,971 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 85 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:18:51,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-11-25 17:18:51,980 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 25. [2022-11-25 17:18:51,980 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-11-25 17:18:51,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-11-25 17:18:51,981 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 25 [2022-11-25 17:18:51,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:51,982 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-11-25 17:18:51,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 2 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 1 states have call successors, (4) [2022-11-25 17:18:51,982 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-11-25 17:18:51,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-11-25 17:18:51,983 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:51,983 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-11-25 17:18:51,997 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:52,192 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:52,192 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:52,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:52,193 INFO L85 PathProgramCache]: Analyzing trace with hash -126969667, now seen corresponding path program 1 times [2022-11-25 17:18:52,193 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:52,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820385665] [2022-11-25 17:18:52,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:52,194 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:52,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:52,205 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1970429070] [2022-11-25 17:18:52,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:52,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:52,206 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:52,207 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:52,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-25 17:18:52,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-25 17:18:52,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 5 conjunts are in the unsatisfiable core [2022-11-25 17:18:52,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:52,322 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:52,323 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:18:52,396 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:52,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:52,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820385665] [2022-11-25 17:18:52,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:52,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970429070] [2022-11-25 17:18:52,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1970429070] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:18:52,397 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:18:52,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 5] total 8 [2022-11-25 17:18:52,397 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [687089764] [2022-11-25 17:18:52,398 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:18:52,398 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-25 17:18:52,398 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:52,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-25 17:18:52,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-11-25 17:18:52,400 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-11-25 17:18:52,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:52,503 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-11-25 17:18:52,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-11-25 17:18:52,504 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-11-25 17:18:52,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:52,507 INFO L225 Difference]: With dead ends: 57 [2022-11-25 17:18:52,507 INFO L226 Difference]: Without dead ends: 52 [2022-11-25 17:18:52,508 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-11-25 17:18:52,513 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 20 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:52,514 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 101 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-25 17:18:52,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-11-25 17:18:52,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-11-25 17:18:52,548 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-11-25 17:18:52,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-11-25 17:18:52,555 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 28 [2022-11-25 17:18:52,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:52,555 INFO L495 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-11-25 17:18:52,556 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-11-25 17:18:52,556 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-11-25 17:18:52,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-11-25 17:18:52,560 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:52,560 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-11-25 17:18:52,566 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:52,765 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:52,766 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:52,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:52,766 INFO L85 PathProgramCache]: Analyzing trace with hash 972990450, now seen corresponding path program 2 times [2022-11-25 17:18:52,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:52,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211321789] [2022-11-25 17:18:52,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:52,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:52,778 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:52,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [815900843] [2022-11-25 17:18:52,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-25 17:18:52,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:52,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:52,782 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:52,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-25 17:18:52,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-25 17:18:52,855 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:18:52,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-25 17:18:52,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:52,999 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:53,000 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:18:53,181 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-11-25 17:18:53,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:53,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211321789] [2022-11-25 17:18:53,181 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:53,181 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [815900843] [2022-11-25 17:18:53,181 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [815900843] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:18:53,181 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:18:53,182 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2022-11-25 17:18:53,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [962389230] [2022-11-25 17:18:53,182 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:18:53,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-11-25 17:18:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:53,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-11-25 17:18:53,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-11-25 17:18:53,184 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-11-25 17:18:53,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:53,396 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-11-25 17:18:53,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-25 17:18:53,397 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-11-25 17:18:53,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:53,398 INFO L225 Difference]: With dead ends: 111 [2022-11-25 17:18:53,398 INFO L226 Difference]: Without dead ends: 106 [2022-11-25 17:18:53,399 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=184, Invalid=322, Unknown=0, NotChecked=0, Total=506 [2022-11-25 17:18:53,399 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 52 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:53,400 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 136 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-25 17:18:53,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2022-11-25 17:18:53,432 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2022-11-25 17:18:53,432 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-11-25 17:18:53,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 117 transitions. [2022-11-25 17:18:53,433 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 117 transitions. Word has length 55 [2022-11-25 17:18:53,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:53,433 INFO L495 AbstractCegarLoop]: Abstraction has 106 states and 117 transitions. [2022-11-25 17:18:53,434 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-11-25 17:18:53,434 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 117 transitions. [2022-11-25 17:18:53,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2022-11-25 17:18:53,435 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:53,435 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-11-25 17:18:53,450 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:53,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:53,647 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:53,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:53,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1909967598, now seen corresponding path program 3 times [2022-11-25 17:18:53,648 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:53,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843835366] [2022-11-25 17:18:53,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:53,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:53,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:53,673 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1058157663] [2022-11-25 17:18:53,673 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-25 17:18:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:53,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:53,676 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:53,686 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-25 17:18:55,854 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 11 check-sat command(s) [2022-11-25 17:18:55,854 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:18:55,858 INFO L263 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 23 conjunts are in the unsatisfiable core [2022-11-25 17:18:55,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:56,147 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:56,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:18:56,537 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-11-25 17:18:56,538 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:56,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843835366] [2022-11-25 17:18:56,538 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:56,538 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1058157663] [2022-11-25 17:18:56,538 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1058157663] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:18:56,539 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:18:56,539 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14] total 26 [2022-11-25 17:18:56,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1828346411] [2022-11-25 17:18:56,539 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:18:56,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-25 17:18:56,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:56,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-25 17:18:56,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-11-25 17:18:56,542 INFO L87 Difference]: Start difference. First operand 106 states and 117 transitions. Second operand has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-25 17:18:57,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:18:57,199 INFO L93 Difference]: Finished difference Result 219 states and 253 transitions. [2022-11-25 17:18:57,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2022-11-25 17:18:57,199 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) Word has length 109 [2022-11-25 17:18:57,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:18:57,202 INFO L225 Difference]: With dead ends: 219 [2022-11-25 17:18:57,202 INFO L226 Difference]: Without dead ends: 214 [2022-11-25 17:18:57,203 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 237 GetRequests, 192 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=796, Invalid=1366, Unknown=0, NotChecked=0, Total=2162 [2022-11-25 17:18:57,204 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 142 mSDsluCounter, 235 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-25 17:18:57,204 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 278 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-25 17:18:57,205 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 214 states. [2022-11-25 17:18:57,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 214 to 214. [2022-11-25 17:18:57,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 214 states, 165 states have (on average 1.1393939393939394) internal successors, (188), 165 states have internal predecessors, (188), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-11-25 17:18:57,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 214 states and 237 transitions. [2022-11-25 17:18:57,258 INFO L78 Accepts]: Start accepts. Automaton has 214 states and 237 transitions. Word has length 109 [2022-11-25 17:18:57,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:18:57,259 INFO L495 AbstractCegarLoop]: Abstraction has 214 states and 237 transitions. [2022-11-25 17:18:57,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 5.076923076923077) internal successors, (132), 26 states have internal predecessors, (132), 23 states have call successors, (25), 13 states have call predecessors, (25), 12 states have return successors, (24), 22 states have call predecessors, (24), 22 states have call successors, (24) [2022-11-25 17:18:57,259 INFO L276 IsEmpty]: Start isEmpty. Operand 214 states and 237 transitions. [2022-11-25 17:18:57,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 218 [2022-11-25 17:18:57,262 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:18:57,262 INFO L195 NwaCegarLoop]: trace histogram [23, 23, 22, 22, 22, 22, 22, 22, 22, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:18:57,275 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-25 17:18:57,470 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:57,471 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:18:57,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:18:57,471 INFO L85 PathProgramCache]: Analyzing trace with hash -1216739502, now seen corresponding path program 4 times [2022-11-25 17:18:57,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:18:57,471 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491978578] [2022-11-25 17:18:57,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:18:57,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:18:57,492 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:18:57,493 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2107949375] [2022-11-25 17:18:57,493 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-25 17:18:57,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:18:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:18:57,494 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:18:57,505 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-25 17:18:57,683 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-25 17:18:57,683 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:18:57,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 47 conjunts are in the unsatisfiable core [2022-11-25 17:18:57,693 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:18:58,436 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 2123 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:18:58,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:18:59,584 INFO L134 CoverageAnalysis]: Checked inductivity of 2171 backedges. 44 proven. 1199 refuted. 0 times theorem prover too weak. 928 trivial. 0 not checked. [2022-11-25 17:18:59,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:18:59,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491978578] [2022-11-25 17:18:59,584 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:18:59,584 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107949375] [2022-11-25 17:18:59,584 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107949375] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:18:59,584 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:18:59,585 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 50 [2022-11-25 17:18:59,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1741739117] [2022-11-25 17:18:59,585 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:18:59,586 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2022-11-25 17:18:59,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:18:59,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2022-11-25 17:18:59,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1133, Invalid=1317, Unknown=0, NotChecked=0, Total=2450 [2022-11-25 17:18:59,590 INFO L87 Difference]: Start difference. First operand 214 states and 237 transitions. Second operand has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-25 17:19:01,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:19:01,361 INFO L93 Difference]: Finished difference Result 435 states and 505 transitions. [2022-11-25 17:19:01,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 94 states. [2022-11-25 17:19:01,362 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) Word has length 217 [2022-11-25 17:19:01,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:19:01,369 INFO L225 Difference]: With dead ends: 435 [2022-11-25 17:19:01,369 INFO L226 Difference]: Without dead ends: 430 [2022-11-25 17:19:01,373 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 477 GetRequests, 384 SyntacticMatches, 0 SemanticMatches, 93 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=3316, Invalid=5614, Unknown=0, NotChecked=0, Total=8930 [2022-11-25 17:19:01,374 INFO L413 NwaCegarLoop]: 67 mSDtfsCounter, 388 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 326 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:19:01,374 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 424 Invalid, 326 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:19:01,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 430 states. [2022-11-25 17:19:01,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 430 to 430. [2022-11-25 17:19:01,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 333 states have (on average 1.1411411411411412) internal successors, (380), 333 states have internal predecessors, (380), 49 states have call successors, (49), 48 states have call predecessors, (49), 47 states have return successors, (48), 48 states have call predecessors, (48), 48 states have call successors, (48) [2022-11-25 17:19:01,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 477 transitions. [2022-11-25 17:19:01,469 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 477 transitions. Word has length 217 [2022-11-25 17:19:01,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:19:01,470 INFO L495 AbstractCegarLoop]: Abstraction has 430 states and 477 transitions. [2022-11-25 17:19:01,470 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 50 states have (on average 5.28) internal successors, (264), 50 states have internal predecessors, (264), 47 states have call successors, (49), 25 states have call predecessors, (49), 24 states have return successors, (48), 46 states have call predecessors, (48), 46 states have call successors, (48) [2022-11-25 17:19:01,470 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 477 transitions. [2022-11-25 17:19:01,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 434 [2022-11-25 17:19:01,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:19:01,478 INFO L195 NwaCegarLoop]: trace histogram [47, 47, 46, 46, 46, 46, 46, 46, 46, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:01,485 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-11-25 17:19:01,684 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-11-25 17:19:01,684 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:19:01,684 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:01,685 INFO L85 PathProgramCache]: Analyzing trace with hash -623866926, now seen corresponding path program 5 times [2022-11-25 17:19:01,685 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:01,685 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980820334] [2022-11-25 17:19:01,685 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:01,685 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:01,736 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:19:01,738 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [622250061] [2022-11-25 17:19:01,739 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-25 17:19:01,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:19:01,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:19:01,741 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:19:01,766 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-25 17:19:02,662 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 47 check-sat command(s) [2022-11-25 17:19:02,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-25 17:19:02,673 INFO L263 TraceCheckSpWp]: Trace formula consists of 989 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-25 17:19:02,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-25 17:19:04,506 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 9407 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-25 17:19:04,507 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-25 17:19:06,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9503 backedges. 92 proven. 5267 refuted. 0 times theorem prover too weak. 4144 trivial. 0 not checked. [2022-11-25 17:19:06,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-25 17:19:06,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980820334] [2022-11-25 17:19:06,274 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-25 17:19:06,274 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [622250061] [2022-11-25 17:19:06,274 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [622250061] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-25 17:19:06,274 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-25 17:19:06,275 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [49, 50] total 54 [2022-11-25 17:19:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191206124] [2022-11-25 17:19:06,277 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-25 17:19:06,278 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-25 17:19:06,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-25 17:19:06,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-25 17:19:06,284 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1331, Invalid=1531, Unknown=0, NotChecked=0, Total=2862 [2022-11-25 17:19:06,285 INFO L87 Difference]: Start difference. First operand 430 states and 477 transitions. Second operand has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-11-25 17:19:08,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-25 17:19:08,309 INFO L93 Difference]: Finished difference Result 471 states and 525 transitions. [2022-11-25 17:19:08,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 102 states. [2022-11-25 17:19:08,310 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) Word has length 433 [2022-11-25 17:19:08,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-25 17:19:08,314 INFO L225 Difference]: With dead ends: 471 [2022-11-25 17:19:08,314 INFO L226 Difference]: Without dead ends: 466 [2022-11-25 17:19:08,317 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 913 GetRequests, 768 SyntacticMatches, 44 SemanticMatches, 101 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2350 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=3926, Invalid=6580, Unknown=0, NotChecked=0, Total=10506 [2022-11-25 17:19:08,318 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 210 mSDsluCounter, 390 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 210 SdHoareTripleChecker+Valid, 461 SdHoareTripleChecker+Invalid, 319 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-11-25 17:19:08,319 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [210 Valid, 461 Invalid, 319 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-11-25 17:19:08,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-11-25 17:19:08,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 466. [2022-11-25 17:19:08,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 466 states, 361 states have (on average 1.1412742382271468) internal successors, (412), 361 states have internal predecessors, (412), 53 states have call successors, (53), 52 states have call predecessors, (53), 51 states have return successors, (52), 52 states have call predecessors, (52), 52 states have call successors, (52) [2022-11-25 17:19:08,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 466 states to 466 states and 517 transitions. [2022-11-25 17:19:08,415 INFO L78 Accepts]: Start accepts. Automaton has 466 states and 517 transitions. Word has length 433 [2022-11-25 17:19:08,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-25 17:19:08,416 INFO L495 AbstractCegarLoop]: Abstraction has 466 states and 517 transitions. [2022-11-25 17:19:08,417 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 54 states have (on average 6.592592592592593) internal successors, (356), 54 states have internal predecessors, (356), 51 states have call successors, (97), 49 states have call predecessors, (97), 48 states have return successors, (96), 50 states have call predecessors, (96), 50 states have call successors, (96) [2022-11-25 17:19:08,417 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 517 transitions. [2022-11-25 17:19:08,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 470 [2022-11-25 17:19:08,427 INFO L187 NwaCegarLoop]: Found error trace [2022-11-25 17:19:08,428 INFO L195 NwaCegarLoop]: trace histogram [51, 51, 50, 50, 50, 50, 50, 50, 50, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-25 17:19:08,446 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-11-25 17:19:08,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:19:08,635 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-25 17:19:08,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-25 17:19:08,636 INFO L85 PathProgramCache]: Analyzing trace with hash -872711022, now seen corresponding path program 6 times [2022-11-25 17:19:08,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-25 17:19:08,636 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [578287046] [2022-11-25 17:19:08,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-25 17:19:08,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-25 17:19:08,678 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-25 17:19:08,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [108118985] [2022-11-25 17:19:08,679 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-25 17:19:08,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-25 17:19:08,679 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 [2022-11-25 17:19:08,680 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-25 17:19:08,702 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-11-25 17:19:46,168 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 51 check-sat command(s) [2022-11-25 17:19:46,168 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-25 17:19:46,168 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-25 17:19:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-25 17:19:46,836 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-25 17:19:46,837 INFO L360 BasicCegarLoop]: Counterexample is feasible [2022-11-25 17:19:46,838 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-25 17:19:46,860 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-11-25 17:19:47,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-11-25 17:19:47,058 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1] [2022-11-25 17:19:47,062 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-25 17:19:47,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.11 05:19:47 BoogieIcfgContainer [2022-11-25 17:19:47,211 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-25 17:19:47,212 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-25 17:19:47,212 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-25 17:19:47,212 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-25 17:19:47,213 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.11 05:18:46" (3/4) ... [2022-11-25 17:19:47,215 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-25 17:19:47,384 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/witness.graphml [2022-11-25 17:19:47,385 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-25 17:19:47,385 INFO L158 Benchmark]: Toolchain (without parser) took 61731.02ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 125.5MB in the beginning and 150.5MB in the end (delta: -25.0MB). Peak memory consumption was 112.0MB. Max. memory is 16.1GB. [2022-11-25 17:19:47,386 INFO L158 Benchmark]: CDTParser took 0.28ms. Allocated memory is still 125.8MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-25 17:19:47,386 INFO L158 Benchmark]: CACSL2BoogieTranslator took 257.68ms. Allocated memory is still 157.3MB. Free memory was 125.5MB in the beginning and 128.2MB in the end (delta: -2.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2022-11-25 17:19:47,386 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.14ms. Allocated memory is still 157.3MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:19:47,387 INFO L158 Benchmark]: Boogie Preprocessor took 24.57ms. Allocated memory is still 157.3MB. Free memory was 126.1MB in the beginning and 124.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-25 17:19:47,387 INFO L158 Benchmark]: RCFGBuilder took 431.86ms. Allocated memory is still 157.3MB. Free memory was 124.8MB in the beginning and 114.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-25 17:19:47,388 INFO L158 Benchmark]: TraceAbstraction took 60766.54ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 113.5MB in the beginning and 60.4MB in the end (delta: 53.1MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. [2022-11-25 17:19:47,388 INFO L158 Benchmark]: Witness Printer took 172.94ms. Allocated memory is still 188.7MB. Free memory was 60.4MB in the beginning and 150.5MB in the end (delta: -90.1MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-25 17:19:47,390 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.28ms. Allocated memory is still 125.8MB. Free memory is still 96.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 257.68ms. Allocated memory is still 157.3MB. Free memory was 125.5MB in the beginning and 128.2MB in the end (delta: -2.7MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.14ms. Allocated memory is still 157.3MB. Free memory was 128.2MB in the beginning and 126.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.57ms. Allocated memory is still 157.3MB. Free memory was 126.1MB in the beginning and 124.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 431.86ms. Allocated memory is still 157.3MB. Free memory was 124.8MB in the beginning and 114.3MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 60766.54ms. Allocated memory was 157.3MB in the beginning and 188.7MB in the end (delta: 31.5MB). Free memory was 113.5MB in the beginning and 60.4MB in the end (delta: 53.1MB). Peak memory consumption was 86.2MB. Max. memory is 16.1GB. * Witness Printer took 172.94ms. Allocated memory is still 188.7MB. Free memory was 60.4MB in the beginning and 150.5MB in the end (delta: -90.1MB). Peak memory consumption was 16.8MB. 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=1565003, counter=0, R=1252] [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=1565003, counter=0, R=1252] [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A VAL [A=1565003, counter=0, r=2501, R=1252, u=2505, v=1] [L34] EXPR counter++ VAL [A=1565003, counter=1, counter++=0, r=2501, R=1252, u=2505, v=1] [L34] COND TRUE counter++<50 [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=1565003, counter=1, r=2501, R=1252, u=2505, v=1] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=1, r=2501, R=1252, u=2505, v=1] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=1, R=1252, r=2500, u=2505, v=3] [L34] EXPR counter++ VAL [A=1565003, counter=2, counter++=1, r=2500, R=1252, u=2505, v=3] [L34] COND TRUE counter++<50 [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=1565003, counter=2, R=1252, r=2500, u=2505, v=3] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=2, R=1252, r=2500, u=2505, v=3] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=2, r=2497, R=1252, u=2505, v=5] [L34] EXPR counter++ VAL [A=1565003, counter=3, counter++=2, r=2497, R=1252, u=2505, v=5] [L34] COND TRUE counter++<50 [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=1565003, counter=3, R=1252, r=2497, u=2505, v=5] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=3, r=2497, R=1252, u=2505, v=5] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=3, R=1252, r=2492, u=2505, v=7] [L34] EXPR counter++ VAL [A=1565003, counter=4, counter++=3, R=1252, r=2492, u=2505, v=7] [L34] COND TRUE counter++<50 [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=1565003, counter=4, r=2492, R=1252, u=2505, v=7] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=4, r=2492, R=1252, u=2505, v=7] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=4, R=1252, r=2485, u=2505, v=9] [L34] EXPR counter++ VAL [A=1565003, counter=5, counter++=4, r=2485, R=1252, u=2505, v=9] [L34] COND TRUE counter++<50 [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=1565003, counter=5, r=2485, R=1252, u=2505, v=9] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=5, R=1252, r=2485, u=2505, v=9] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=5, R=1252, r=2476, u=2505, v=11] [L34] EXPR counter++ VAL [A=1565003, counter=6, counter++=5, r=2476, R=1252, u=2505, v=11] [L34] COND TRUE counter++<50 [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=1565003, counter=6, r=2476, R=1252, u=2505, v=11] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=6, r=2476, R=1252, u=2505, v=11] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=6, r=2465, R=1252, u=2505, v=13] [L34] EXPR counter++ VAL [A=1565003, counter=7, counter++=6, R=1252, r=2465, u=2505, v=13] [L34] COND TRUE counter++<50 [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=1565003, counter=7, r=2465, R=1252, u=2505, v=13] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=7, R=1252, r=2465, u=2505, v=13] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=7, r=2452, R=1252, u=2505, v=15] [L34] EXPR counter++ VAL [A=1565003, counter=8, counter++=7, r=2452, R=1252, u=2505, v=15] [L34] COND TRUE counter++<50 [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=1565003, counter=8, R=1252, r=2452, u=2505, v=15] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=8, r=2452, R=1252, u=2505, v=15] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=8, r=2437, R=1252, u=2505, v=17] [L34] EXPR counter++ VAL [A=1565003, counter=9, counter++=8, r=2437, R=1252, u=2505, v=17] [L34] COND TRUE counter++<50 [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=1565003, counter=9, R=1252, r=2437, u=2505, v=17] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=9, r=2437, R=1252, u=2505, v=17] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=9, R=1252, r=2420, u=2505, v=19] [L34] EXPR counter++ VAL [A=1565003, counter=10, counter++=9, r=2420, R=1252, u=2505, v=19] [L34] COND TRUE counter++<50 [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=1565003, counter=10, r=2420, R=1252, u=2505, v=19] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=10, r=2420, R=1252, u=2505, v=19] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=10, R=1252, r=2401, u=2505, v=21] [L34] EXPR counter++ VAL [A=1565003, counter=11, counter++=10, r=2401, R=1252, u=2505, v=21] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=11] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=11] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=11, r=2401, R=1252, u=2505, v=21] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=11, r=2401, R=1252, u=2505, v=21] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=11, R=1252, r=2380, u=2505, v=23] [L34] EXPR counter++ VAL [A=1565003, counter=12, counter++=11, r=2380, R=1252, u=2505, v=23] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=12] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=12] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=12, r=2380, R=1252, u=2505, v=23] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=12, R=1252, r=2380, u=2505, v=23] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=12, R=1252, r=2357, u=2505, v=25] [L34] EXPR counter++ VAL [A=1565003, counter=13, counter++=12, r=2357, R=1252, u=2505, v=25] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=13] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=13] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=13, R=1252, r=2357, u=2505, v=25] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=13, R=1252, r=2357, u=2505, v=25] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=13, R=1252, r=2332, u=2505, v=27] [L34] EXPR counter++ VAL [A=1565003, counter=14, counter++=13, R=1252, r=2332, u=2505, v=27] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=14] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=14] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=14, R=1252, r=2332, u=2505, v=27] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=14, R=1252, r=2332, u=2505, v=27] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=14, r=2305, R=1252, u=2505, v=29] [L34] EXPR counter++ VAL [A=1565003, counter=15, counter++=14, r=2305, R=1252, u=2505, v=29] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=15] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=15] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=15, r=2305, R=1252, u=2505, v=29] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=15, R=1252, r=2305, u=2505, v=29] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=15, r=2276, R=1252, u=2505, v=31] [L34] EXPR counter++ VAL [A=1565003, counter=16, counter++=15, r=2276, R=1252, u=2505, v=31] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=16] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=16] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=16, R=1252, r=2276, u=2505, v=31] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=16, r=2276, R=1252, u=2505, v=31] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=16, r=2245, R=1252, u=2505, v=33] [L34] EXPR counter++ VAL [A=1565003, counter=17, counter++=16, r=2245, R=1252, u=2505, v=33] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=17] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=17] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=17, R=1252, r=2245, u=2505, v=33] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=17, R=1252, r=2245, u=2505, v=33] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=17, r=2212, R=1252, u=2505, v=35] [L34] EXPR counter++ VAL [A=1565003, counter=18, counter++=17, r=2212, R=1252, u=2505, v=35] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=18] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=18] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=18, R=1252, r=2212, u=2505, v=35] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=18, R=1252, r=2212, u=2505, v=35] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=18, R=1252, r=2177, u=2505, v=37] [L34] EXPR counter++ VAL [A=1565003, counter=19, counter++=18, r=2177, R=1252, u=2505, v=37] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=19] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=19] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=19, r=2177, R=1252, u=2505, v=37] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=19, r=2177, R=1252, u=2505, v=37] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=19, R=1252, r=2140, u=2505, v=39] [L34] EXPR counter++ VAL [A=1565003, counter=20, counter++=19, r=2140, R=1252, u=2505, v=39] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=20] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=20] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=20, R=1252, r=2140, u=2505, v=39] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=20, R=1252, r=2140, u=2505, v=39] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=20, r=2101, R=1252, u=2505, v=41] [L34] EXPR counter++ VAL [A=1565003, counter=21, counter++=20, r=2101, R=1252, u=2505, v=41] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=21] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=21] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=21, R=1252, r=2101, u=2505, v=41] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=21, r=2101, R=1252, u=2505, v=41] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=21, R=1252, r=2060, u=2505, v=43] [L34] EXPR counter++ VAL [A=1565003, counter=22, counter++=21, r=2060, R=1252, u=2505, v=43] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=22] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=22] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=22, R=1252, r=2060, u=2505, v=43] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=22, R=1252, r=2060, u=2505, v=43] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=22, R=1252, r=2017, u=2505, v=45] [L34] EXPR counter++ VAL [A=1565003, counter=23, counter++=22, R=1252, r=2017, u=2505, v=45] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=23] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=23] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=23, r=2017, R=1252, u=2505, v=45] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=23, R=1252, r=2017, u=2505, v=45] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=23, r=1972, R=1252, u=2505, v=47] [L34] EXPR counter++ VAL [A=1565003, counter=24, counter++=23, r=1972, R=1252, u=2505, v=47] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=24] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=24] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=24, r=1972, R=1252, u=2505, v=47] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=24, R=1252, r=1972, u=2505, v=47] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=24, r=1925, R=1252, u=2505, v=49] [L34] EXPR counter++ VAL [A=1565003, counter=25, counter++=24, R=1252, r=1925, u=2505, v=49] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=25] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=25] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=25, r=1925, R=1252, u=2505, v=49] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=25, r=1925, R=1252, u=2505, v=49] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=25, r=1876, R=1252, u=2505, v=51] [L34] EXPR counter++ VAL [A=1565003, counter=26, counter++=25, r=1876, R=1252, u=2505, v=51] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=26] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=26] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=26, r=1876, R=1252, u=2505, v=51] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=26, r=1876, R=1252, u=2505, v=51] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=26, r=1825, R=1252, u=2505, v=53] [L34] EXPR counter++ VAL [A=1565003, counter=27, counter++=26, R=1252, r=1825, u=2505, v=53] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=27] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=27] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=27, r=1825, R=1252, u=2505, v=53] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=27, r=1825, R=1252, u=2505, v=53] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=27, R=1252, r=1772, u=2505, v=55] [L34] EXPR counter++ VAL [A=1565003, counter=28, counter++=27, R=1252, r=1772, u=2505, v=55] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=28] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=28] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=28, R=1252, r=1772, u=2505, v=55] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=28, R=1252, r=1772, u=2505, v=55] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=28, r=1717, R=1252, u=2505, v=57] [L34] EXPR counter++ VAL [A=1565003, counter=29, counter++=28, r=1717, R=1252, u=2505, v=57] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=29] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=29] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=29, r=1717, R=1252, u=2505, v=57] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=29, R=1252, r=1717, u=2505, v=57] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=29, R=1252, r=1660, u=2505, v=59] [L34] EXPR counter++ VAL [A=1565003, counter=30, counter++=29, r=1660, R=1252, u=2505, v=59] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=30] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=30] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=30, r=1660, R=1252, u=2505, v=59] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=30, r=1660, R=1252, u=2505, v=59] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=30, r=1601, R=1252, u=2505, v=61] [L34] EXPR counter++ VAL [A=1565003, counter=31, counter++=30, R=1252, r=1601, u=2505, v=61] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=31] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=31] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=31, r=1601, R=1252, u=2505, v=61] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=31, R=1252, r=1601, u=2505, v=61] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=31, r=1540, R=1252, u=2505, v=63] [L34] EXPR counter++ VAL [A=1565003, counter=32, counter++=31, R=1252, r=1540, u=2505, v=63] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=32] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=32] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=32, r=1540, R=1252, u=2505, v=63] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=32, R=1252, r=1540, u=2505, v=63] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=32, r=1477, R=1252, u=2505, v=65] [L34] EXPR counter++ VAL [A=1565003, counter=33, counter++=32, r=1477, R=1252, u=2505, v=65] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=33] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=33] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=33, R=1252, r=1477, u=2505, v=65] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=33, r=1477, R=1252, u=2505, v=65] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=33, r=1412, R=1252, u=2505, v=67] [L34] EXPR counter++ VAL [A=1565003, counter=34, counter++=33, r=1412, R=1252, u=2505, v=67] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=34] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=34] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=34, r=1412, R=1252, u=2505, v=67] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=34, R=1252, r=1412, u=2505, v=67] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=34, r=1345, R=1252, u=2505, v=69] [L34] EXPR counter++ VAL [A=1565003, counter=35, counter++=34, r=1345, R=1252, u=2505, v=69] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=35] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=35] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=35, R=1252, r=1345, u=2505, v=69] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=35, R=1252, r=1345, u=2505, v=69] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=35, R=1252, r=1276, u=2505, v=71] [L34] EXPR counter++ VAL [A=1565003, counter=36, counter++=35, r=1276, R=1252, u=2505, v=71] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=36] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=36] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=36, R=1252, r=1276, u=2505, v=71] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=36, R=1252, r=1276, u=2505, v=71] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=36, R=1252, r=1205, u=2505, v=73] [L34] EXPR counter++ VAL [A=1565003, counter=37, counter++=36, R=1252, r=1205, u=2505, v=73] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=37] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=37] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=37, r=1205, R=1252, u=2505, v=73] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=37, R=1252, r=1205, u=2505, v=73] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=37, R=1252, r=1132, u=2505, v=75] [L34] EXPR counter++ VAL [A=1565003, counter=38, counter++=37, r=1132, R=1252, u=2505, v=75] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=38] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=38] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=38, r=1132, R=1252, u=2505, v=75] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=38, r=1132, R=1252, u=2505, v=75] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=38, r=1057, R=1252, u=2505, v=77] [L34] EXPR counter++ VAL [A=1565003, counter=39, counter++=38, R=1252, r=1057, u=2505, v=77] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=39] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=39] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=39, r=1057, R=1252, u=2505, v=77] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=39, R=1252, r=1057, u=2505, v=77] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=39, r=980, R=1252, u=2505, v=79] [L34] EXPR counter++ VAL [A=1565003, counter=40, counter++=39, r=980, R=1252, u=2505, v=79] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=40] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=40] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=40, r=980, R=1252, u=2505, v=79] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=40, R=1252, r=980, u=2505, v=79] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=40, r=901, R=1252, u=2505, v=81] [L34] EXPR counter++ VAL [A=1565003, counter=41, counter++=40, r=901, R=1252, u=2505, v=81] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=41] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=41] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=41, R=1252, r=901, u=2505, v=81] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=41, r=901, R=1252, u=2505, v=81] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=41, R=1252, r=820, u=2505, v=83] [L34] EXPR counter++ VAL [A=1565003, counter=42, counter++=41, R=1252, r=820, u=2505, v=83] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=42] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=42] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=42, R=1252, r=820, u=2505, v=83] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=42, r=820, R=1252, u=2505, v=83] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=42, r=737, R=1252, u=2505, v=85] [L34] EXPR counter++ VAL [A=1565003, counter=43, counter++=42, R=1252, r=737, u=2505, v=85] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=43] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=43] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=43, r=737, R=1252, u=2505, v=85] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=43, r=737, R=1252, u=2505, v=85] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=43, r=652, R=1252, u=2505, v=87] [L34] EXPR counter++ VAL [A=1565003, counter=44, counter++=43, R=1252, r=652, u=2505, v=87] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=44] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=44] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=44, r=652, R=1252, u=2505, v=87] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=44, R=1252, r=652, u=2505, v=87] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=44, R=1252, r=565, u=2505, v=89] [L34] EXPR counter++ VAL [A=1565003, counter=45, counter++=44, r=565, R=1252, u=2505, v=89] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=45] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=45] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=45, R=1252, r=565, u=2505, v=89] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=45, r=565, R=1252, u=2505, v=89] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=45, R=1252, r=476, u=2505, v=91] [L34] EXPR counter++ VAL [A=1565003, counter=46, counter++=45, R=1252, r=476, u=2505, v=91] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=46] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=46] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=46, R=1252, r=476, u=2505, v=91] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=46, R=1252, r=476, u=2505, v=91] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=46, R=1252, r=385, u=2505, v=93] [L34] EXPR counter++ VAL [A=1565003, counter=47, counter++=46, R=1252, r=385, u=2505, v=93] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=47] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=47] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=47, r=385, R=1252, u=2505, v=93] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=47, R=1252, r=385, u=2505, v=93] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=47, R=1252, r=292, u=2505, v=95] [L34] EXPR counter++ VAL [A=1565003, counter=48, counter++=47, r=292, R=1252, u=2505, v=95] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=48] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=48] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=48, r=292, R=1252, u=2505, v=95] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=48, r=292, R=1252, u=2505, v=95] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=48, r=197, R=1252, u=2505, v=97] [L34] EXPR counter++ VAL [A=1565003, counter=49, counter++=48, r=197, R=1252, u=2505, v=97] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=49] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=49] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=49, R=1252, r=197, u=2505, v=97] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=49, r=197, R=1252, u=2505, v=97] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=49, R=1252, r=100, u=2505, v=99] [L34] EXPR counter++ VAL [A=1565003, counter=50, counter++=49, r=100, R=1252, u=2505, v=99] [L34] COND TRUE counter++<50 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=1, counter=50] [L12] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1, counter=50] [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) VAL [A=1565003, counter=50, R=1252, r=100, u=2505, v=99] [L36] COND FALSE !(!(r != 0)) VAL [A=1565003, counter=50, r=100, R=1252, u=2505, v=99] [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 VAL [A=1565003, counter=50, R=1252, r=1, u=2505, v=101] [L34] EXPR counter++ VAL [A=1565003, counter=51, counter++=50, r=1, R=1252, u=2505, v=101] [L34] COND FALSE !(counter++<50) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) VAL [\old(cond)=0, counter=51] [L12] COND TRUE !(cond) VAL [\old(cond)=0, cond=0, counter=51] [L14] reach_error() VAL [\old(cond)=0, cond=0, counter=51] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 25 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 60.5s, OverallIterations: 10, TraceHistogramMax: 51, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 856 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 854 mSDsluCounter, 1650 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1328 mSDsCounter, 78 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 958 IncrementalHoareTripleChecker+Invalid, 1036 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 78 mSolverCounterUnsat, 322 mSDtfsCounter, 958 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1907 GetRequests, 1572 SyntacticMatches, 44 SemanticMatches, 291 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4003 ImplicationChecksByTransitivity, 7.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=466occurred in iteration=9, InterpolantAutomatonStates: 296, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 9 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 40.7s SatisfiabilityAnalysisTime, 7.4s InterpolantComputationTime, 1392 NumberOfCodeBlocks, 1392 NumberOfCodeBlocksAsserted, 118 NumberOfCheckSat, 1775 ConstructedInterpolants, 0 QuantifiedInterpolants, 4553 SizeOfPredicates, 93 NumberOfNonLiveVariables, 2288 ConjunctsInSsa, 215 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 5662/24434 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-11-25 17:19:47,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_28cdbd64-0618-4bc3-a636-b7a99db52c06/bin/uautomizer-ZsLfNo2U6R/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE