./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/recursive-simple/id_o1000.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 2329fc70 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_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/recursive-simple/id_o1000.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8 --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 1ac5ce2c5b306e431b6746a0cb1bbdfcd1ec9c3d54097bd6037af4480ff2bd07 --- 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-2329fc7 [2022-12-13 20:45:55,419 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 20:45:55,421 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 20:45:55,441 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 20:45:55,441 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 20:45:55,442 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 20:45:55,444 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 20:45:55,445 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 20:45:55,447 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 20:45:55,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 20:45:55,449 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 20:45:55,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 20:45:55,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 20:45:55,452 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 20:45:55,453 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 20:45:55,454 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 20:45:55,455 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 20:45:55,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 20:45:55,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 20:45:55,459 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 20:45:55,461 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 20:45:55,462 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 20:45:55,463 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 20:45:55,464 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 20:45:55,468 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 20:45:55,468 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 20:45:55,468 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 20:45:55,469 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 20:45:55,470 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 20:45:55,471 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 20:45:55,471 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 20:45:55,472 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 20:45:55,472 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 20:45:55,473 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 20:45:55,474 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 20:45:55,474 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 20:45:55,475 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 20:45:55,475 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 20:45:55,475 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 20:45:55,476 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 20:45:55,477 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 20:45:55,478 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-12-13 20:45:55,498 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 20:45:55,498 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 20:45:55,498 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 20:45:55,498 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 20:45:55,499 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-12-13 20:45:55,499 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-12-13 20:45:55,500 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 20:45:55,500 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 20:45:55,500 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 20:45:55,500 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 20:45:55,501 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 20:45:55,501 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 20:45:55,501 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 20:45:55,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 20:45:55,501 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-12-13 20:45:55,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-12-13 20:45:55,502 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-12-13 20:45:55,502 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 20:45:55,502 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 20:45:55,502 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 20:45:55,502 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-12-13 20:45:55,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 20:45:55,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 20:45:55,502 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:45:55,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-12-13 20:45:55,503 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2022-12-13 20:45:55,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-12-13 20:45:55,504 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2022-12-13 20:45:55,504 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_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/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_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8 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 -> 1ac5ce2c5b306e431b6746a0cb1bbdfcd1ec9c3d54097bd6037af4480ff2bd07 [2022-12-13 20:45:55,693 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 20:45:55,709 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 20:45:55,711 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 20:45:55,712 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 20:45:55,712 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 20:45:55,713 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/recursive-simple/id_o1000.c [2022-12-13 20:45:58,385 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 20:45:58,544 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 20:45:58,545 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/sv-benchmarks/c/recursive-simple/id_o1000.c [2022-12-13 20:45:58,550 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/data/e58ee153e/1399280d192745e59507b39ec66d9e0a/FLAG0ed31ac8e [2022-12-13 20:45:58,561 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/data/e58ee153e/1399280d192745e59507b39ec66d9e0a [2022-12-13 20:45:58,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 20:45:58,565 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 20:45:58,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 20:45:58,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 20:45:58,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 20:45:58,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@558ab0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58, skipping insertion in model container [2022-12-13 20:45:58,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,577 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 20:45:58,586 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 20:45:58,686 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_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/sv-benchmarks/c/recursive-simple/id_o1000.c[520,533] [2022-12-13 20:45:58,689 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:45:58,697 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 20:45:58,706 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_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/sv-benchmarks/c/recursive-simple/id_o1000.c[520,533] [2022-12-13 20:45:58,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 20:45:58,716 INFO L208 MainTranslator]: Completed translation [2022-12-13 20:45:58,716 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58 WrapperNode [2022-12-13 20:45:58,716 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 20:45:58,717 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 20:45:58,717 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 20:45:58,717 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 20:45:58,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,727 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,738 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 19 [2022-12-13 20:45:58,738 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 20:45:58,739 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 20:45:58,739 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 20:45:58,739 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 20:45:58,745 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,746 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,746 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,746 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,748 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,749 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,750 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 20:45:58,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 20:45:58,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 20:45:58,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 20:45:58,752 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (1/1) ... [2022-12-13 20:45:58,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-12-13 20:45:58,764 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:45:58,774 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-12-13 20:45:58,775 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-12-13 20:45:58,807 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 20:45:58,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 20:45:58,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 20:45:58,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 20:45:58,807 INFO L130 BoogieDeclarations]: Found specification of procedure id [2022-12-13 20:45:58,807 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2022-12-13 20:45:58,867 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 20:45:58,869 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 20:45:58,936 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 20:45:58,940 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 20:45:58,941 INFO L300 CfgBuilder]: Removed 0 assume(true) statements. [2022-12-13 20:45:58,942 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:45:58 BoogieIcfgContainer [2022-12-13 20:45:58,942 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 20:45:58,944 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-12-13 20:45:58,944 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-12-13 20:45:58,947 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-12-13 20:45:58,947 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.12 08:45:58" (1/3) ... [2022-12-13 20:45:58,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70842c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:45:58, skipping insertion in model container [2022-12-13 20:45:58,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 08:45:58" (2/3) ... [2022-12-13 20:45:58,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70842c93 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.12 08:45:58, skipping insertion in model container [2022-12-13 20:45:58,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 08:45:58" (3/3) ... [2022-12-13 20:45:58,949 INFO L112 eAbstractionObserver]: Analyzing ICFG id_o1000.c [2022-12-13 20:45:58,966 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-12-13 20:45:58,966 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-12-13 20:45:59,006 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-12-13 20:45:59,012 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;@7bcc1830, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2022-12-13 20:45:59,012 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-12-13 20:45:59,016 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-12-13 20:45:59,022 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-12-13 20:45:59,023 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:45:59,023 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:45:59,024 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:45:59,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:45:59,028 INFO L85 PathProgramCache]: Analyzing trace with hash -358017204, now seen corresponding path program 1 times [2022-12-13 20:45:59,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:45:59,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1935297015] [2022-12-13 20:45:59,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:59,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:45:59,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:59,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:45:59,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:59,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 20:45:59,282 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:45:59,282 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1935297015] [2022-12-13 20:45:59,283 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1935297015] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 20:45:59,283 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 20:45:59,283 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-12-13 20:45:59,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475848590] [2022-12-13 20:45:59,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 20:45:59,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-12-13 20:45:59,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:45:59,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-12-13 20:45:59,316 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:45:59,318 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 20:45:59,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:45:59,357 INFO L93 Difference]: Finished difference Result 28 states and 30 transitions. [2022-12-13 20:45:59,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-12-13 20:45:59,359 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 10 [2022-12-13 20:45:59,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:45:59,365 INFO L225 Difference]: With dead ends: 28 [2022-12-13 20:45:59,365 INFO L226 Difference]: Without dead ends: 15 [2022-12-13 20:45:59,367 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-12-13 20:45:59,369 INFO L413 NwaCegarLoop]: 15 mSDtfsCounter, 3 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:45:59,370 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:45:59,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2022-12-13 20:45:59,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2022-12-13 20:45:59,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-12-13 20:45:59,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2022-12-13 20:45:59,398 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2022-12-13 20:45:59,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:45:59,398 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2022-12-13 20:45:59,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-12-13 20:45:59,399 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2022-12-13 20:45:59,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-12-13 20:45:59,400 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:45:59,400 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:45:59,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-12-13 20:45:59,400 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:45:59,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:45:59,401 INFO L85 PathProgramCache]: Analyzing trace with hash 679465686, now seen corresponding path program 1 times [2022-12-13 20:45:59,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:45:59,401 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [456980617] [2022-12-13 20:45:59,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:59,402 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:45:59,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:59,514 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:45:59,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:59,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:45:59,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:59,595 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:45:59,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:45:59,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [456980617] [2022-12-13 20:45:59,596 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [456980617] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:45:59,596 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [106428391] [2022-12-13 20:45:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:45:59,597 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:45:59,597 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:45:59,598 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:45:59,599 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-12-13 20:45:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:45:59,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 12 conjunts are in the unsatisfiable core [2022-12-13 20:45:59,646 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:45:59,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:45:59,754 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:45:59,861 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-12-13 20:45:59,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [106428391] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:45:59,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:45:59,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2022-12-13 20:45:59,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [190663729] [2022-12-13 20:45:59,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:45:59,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-12-13 20:45:59,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:45:59,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-12-13 20:45:59,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:45:59,866 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 20:45:59,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:45:59,910 INFO L93 Difference]: Finished difference Result 27 states and 29 transitions. [2022-12-13 20:45:59,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-12-13 20:45:59,911 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 16 [2022-12-13 20:45:59,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:45:59,911 INFO L225 Difference]: With dead ends: 27 [2022-12-13 20:45:59,912 INFO L226 Difference]: Without dead ends: 21 [2022-12-13 20:45:59,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2022-12-13 20:45:59,913 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 0 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-12-13 20:45:59,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 95 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-12-13 20:45:59,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-12-13 20:45:59,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-12-13 20:45:59,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2022-12-13 20:45:59,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2022-12-13 20:45:59,920 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 16 [2022-12-13 20:45:59,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:45:59,920 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2022-12-13 20:45:59,920 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 9 states have internal predecessors, (19), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2022-12-13 20:45:59,921 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2022-12-13 20:45:59,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-12-13 20:45:59,922 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:45:59,922 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:45:59,927 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-12-13 20:46:00,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:00,124 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:46:00,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:46:00,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1769866774, now seen corresponding path program 2 times [2022-12-13 20:46:00,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:46:00,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897755702] [2022-12-13 20:46:00,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:00,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:46:00,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:00,325 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:00,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:00,375 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:00,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:00,417 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:00,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:00,453 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:00,475 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 20:46:00,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897755702] [2022-12-13 20:46:00,476 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897755702] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:46:00,476 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1316334071] [2022-12-13 20:46:00,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-12-13 20:46:00,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:00,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:46:00,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:46:00,478 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-12-13 20:46:00,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-12-13 20:46:00,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:46:00,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 20 conjunts are in the unsatisfiable core [2022-12-13 20:46:00,519 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:46:00,604 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 20:46:00,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:46:00,826 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-12-13 20:46:00,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1316334071] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:46:00,827 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:46:00,827 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2022-12-13 20:46:00,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [463629483] [2022-12-13 20:46:00,827 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:46:00,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-12-13 20:46:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:46:00,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-12-13 20:46:00,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=352, Unknown=0, NotChecked=0, Total=420 [2022-12-13 20:46:00,828 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 20:46:01,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:46:01,014 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2022-12-13 20:46:01,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-12-13 20:46:01,015 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) Word has length 28 [2022-12-13 20:46:01,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:46:01,015 INFO L225 Difference]: With dead ends: 39 [2022-12-13 20:46:01,016 INFO L226 Difference]: Without dead ends: 33 [2022-12-13 20:46:01,016 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 1 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=102, Invalid=498, Unknown=0, NotChecked=0, Total=600 [2022-12-13 20:46:01,017 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-12-13 20:46:01,017 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 183 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-12-13 20:46:01,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-12-13 20:46:01,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-12-13 20:46:01,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2022-12-13 20:46:01,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2022-12-13 20:46:01,023 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2022-12-13 20:46:01,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:46:01,024 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2022-12-13 20:46:01,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.2857142857142858) internal successors, (27), 13 states have internal predecessors, (27), 1 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (8), 8 states have call predecessors, (8), 1 states have call successors, (8) [2022-12-13 20:46:01,024 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2022-12-13 20:46:01,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-12-13 20:46:01,026 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:46:01,026 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:46:01,030 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-12-13 20:46:01,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:01,228 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:46:01,229 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:46:01,230 INFO L85 PathProgramCache]: Analyzing trace with hash -626238314, now seen corresponding path program 3 times [2022-12-13 20:46:01,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:46:01,231 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794323935] [2022-12-13 20:46:01,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:01,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:46:01,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,532 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,604 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,685 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,732 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,774 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,852 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:01,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:01,873 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 20:46:01,873 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:01,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794323935] [2022-12-13 20:46:01,873 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794323935] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:46:01,873 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [982010377] [2022-12-13 20:46:01,873 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-12-13 20:46:01,873 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:01,873 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:46:01,874 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:46:01,875 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-12-13 20:46:01,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 8 check-sat command(s) [2022-12-13 20:46:01,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:46:01,947 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 36 conjunts are in the unsatisfiable core [2022-12-13 20:46:01,949 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:46:02,057 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 20:46:02,057 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:46:02,727 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2022-12-13 20:46:02,727 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [982010377] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:46:02,728 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:46:02,728 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2022-12-13 20:46:02,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363441396] [2022-12-13 20:46:02,728 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:46:02,729 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-12-13 20:46:02,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:46:02,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-12-13 20:46:02,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=188, Invalid=1144, Unknown=0, NotChecked=0, Total=1332 [2022-12-13 20:46:02,731 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 20:46:06,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:46:06,767 INFO L93 Difference]: Finished difference Result 63 states and 71 transitions. [2022-12-13 20:46:06,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-12-13 20:46:06,767 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) Word has length 52 [2022-12-13 20:46:06,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:46:06,769 INFO L225 Difference]: With dead ends: 63 [2022-12-13 20:46:06,769 INFO L226 Difference]: Without dead ends: 57 [2022-12-13 20:46:06,771 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 183 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=386, Invalid=1966, Unknown=0, NotChecked=0, Total=2352 [2022-12-13 20:46:06,772 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 327 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 353 SdHoareTripleChecker+Invalid, 294 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-12-13 20:46:06,772 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 353 Invalid, 294 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-12-13 20:46:06,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-12-13 20:46:06,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-12-13 20:46:06,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (17), 16 states have call predecessors, (17), 2 states have call successors, (17) [2022-12-13 20:46:06,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2022-12-13 20:46:06,778 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 52 [2022-12-13 20:46:06,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:46:06,778 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2022-12-13 20:46:06,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 1.162162162162162) internal successors, (43), 21 states have internal predecessors, (43), 1 states have call successors, (2), 1 states have call predecessors, (2), 16 states have return successors, (16), 16 states have call predecessors, (16), 1 states have call successors, (16) [2022-12-13 20:46:06,778 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2022-12-13 20:46:06,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2022-12-13 20:46:06,780 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:46:06,780 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:46:06,784 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-12-13 20:46:06,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:06,981 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:46:06,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:46:06,983 INFO L85 PathProgramCache]: Analyzing trace with hash 415287702, now seen corresponding path program 4 times [2022-12-13 20:46:06,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:46:06,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671050978] [2022-12-13 20:46:06,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:46:06,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:46:07,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:07,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:07,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:07,394 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:07,535 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:07,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:07,713 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:07,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:07,838 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:07,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:07,939 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:07,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,033 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,151 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,254 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,349 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,428 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,507 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,573 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,636 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,696 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,758 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:46:08,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:46:08,787 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-12-13 20:46:08,787 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:46:08,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671050978] [2022-12-13 20:46:08,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671050978] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:46:08,788 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1856885203] [2022-12-13 20:46:08,788 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-12-13 20:46:08,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:46:08,788 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:46:08,789 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:46:08,790 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-12-13 20:46:08,836 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-12-13 20:46:08,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:46:08,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 68 conjunts are in the unsatisfiable core [2022-12-13 20:46:08,841 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:46:09,014 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-12-13 20:46:09,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:46:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2022-12-13 20:46:11,183 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1856885203] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:46:11,183 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:46:11,183 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [35, 35, 35] total 69 [2022-12-13 20:46:11,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498771733] [2022-12-13 20:46:11,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:46:11,184 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 69 states [2022-12-13 20:46:11,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:46:11,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 69 interpolants. [2022-12-13 20:46:11,187 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=620, Invalid=4072, Unknown=0, NotChecked=0, Total=4692 [2022-12-13 20:46:11,187 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2022-12-13 20:46:37,838 WARN L233 SmtUtils]: Spent 19.36s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:47:14,515 WARN L233 SmtUtils]: Spent 21.81s on a formula simplification that was a NOOP. DAG size: 77 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:47:33,335 WARN L233 SmtUtils]: Spent 14.30s on a formula simplification that was a NOOP. DAG size: 74 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:47:49,056 WARN L233 SmtUtils]: Spent 11.83s on a formula simplification that was a NOOP. DAG size: 72 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:48:04,896 WARN L233 SmtUtils]: Spent 11.46s on a formula simplification that was a NOOP. DAG size: 69 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:48:19,815 WARN L233 SmtUtils]: Spent 10.60s on a formula simplification that was a NOOP. DAG size: 67 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:48:30,632 WARN L233 SmtUtils]: Spent 6.64s on a formula simplification that was a NOOP. DAG size: 64 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:48:39,666 WARN L233 SmtUtils]: Spent 6.73s on a formula simplification that was a NOOP. DAG size: 62 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:48:48,648 WARN L233 SmtUtils]: Spent 6.24s on a formula simplification that was a NOOP. DAG size: 59 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:49:02,850 WARN L233 SmtUtils]: Spent 11.78s on a formula simplification that was a NOOP. DAG size: 57 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:49:30,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 20:49:30,051 INFO L93 Difference]: Finished difference Result 111 states and 127 transitions. [2022-12-13 20:49:30,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2022-12-13 20:49:30,052 INFO L78 Accepts]: Start accepts. Automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) Word has length 100 [2022-12-13 20:49:30,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-12-13 20:49:30,054 INFO L225 Difference]: With dead ends: 111 [2022-12-13 20:49:30,054 INFO L226 Difference]: Without dead ends: 105 [2022-12-13 20:49:30,059 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 293 GetRequests, 197 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 747 ImplicationChecksByTransitivity, 199.8s TimeCoverageRelationStatistics Valid=1530, Invalid=7781, Unknown=1, NotChecked=0, Total=9312 [2022-12-13 20:49:30,060 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 0 mSDsluCounter, 943 mSDsCounter, 0 mSdLazyCounter, 1129 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 985 SdHoareTripleChecker+Invalid, 1129 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 1129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-12-13 20:49:30,060 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 985 Invalid, 1129 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 1129 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-12-13 20:49:30,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-12-13 20:49:30,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-12-13 20:49:30,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 70 states have (on average 1.0142857142857142) internal successors, (71), 71 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (33), 32 states have call predecessors, (33), 2 states have call successors, (33) [2022-12-13 20:49:30,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 106 transitions. [2022-12-13 20:49:30,074 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 106 transitions. Word has length 100 [2022-12-13 20:49:30,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-12-13 20:49:30,075 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 106 transitions. [2022-12-13 20:49:30,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 69 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 37 states have internal predecessors, (75), 1 states have call successors, (2), 1 states have call predecessors, (2), 32 states have return successors, (32), 32 states have call predecessors, (32), 1 states have call successors, (32) [2022-12-13 20:49:30,076 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 106 transitions. [2022-12-13 20:49:30,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 197 [2022-12-13 20:49:30,080 INFO L187 NwaCegarLoop]: Found error trace [2022-12-13 20:49:30,080 INFO L195 NwaCegarLoop]: trace histogram [32, 32, 31, 31, 31, 31, 1, 1, 1, 1, 1, 1, 1, 1] [2022-12-13 20:49:30,085 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-12-13 20:49:30,280 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:30,282 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-12-13 20:49:30,282 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 20:49:30,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1665704854, now seen corresponding path program 5 times [2022-12-13 20:49:30,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 20:49:30,283 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061672606] [2022-12-13 20:49:30,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 20:49:30,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 20:49:30,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:30,972 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:31,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:31,440 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:31,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:31,872 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:31,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:32,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:32,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:33,022 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:33,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:33,448 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:33,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:33,764 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:33,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:34,098 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:34,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:34,343 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:34,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:34,617 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:34,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:34,817 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:34,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:35,026 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:35,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:35,188 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:35,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:35,350 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:35,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:35,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:35,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:35,663 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:35,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:35,779 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:35,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:35,909 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,027 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,144 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,601 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,710 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,814 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:36,916 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:36,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:37,015 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:37,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:37,114 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:37,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:37,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:37,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:37,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-12-13 20:49:37,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 20:49:37,345 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2022-12-13 20:49:37,345 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 20:49:37,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061672606] [2022-12-13 20:49:37,345 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061672606] provided 0 perfect and 1 imperfect interpolant sequences [2022-12-13 20:49:37,345 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185157075] [2022-12-13 20:49:37,345 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-12-13 20:49:37,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-12-13 20:49:37,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 20:49:37,346 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-12-13 20:49:37,347 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f3be32fc-9c47-44a1-b5aa-1a2fa128cfa9/bin/uautomizer-uyxdKDjOR8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-12-13 20:49:50,301 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 32 check-sat command(s) [2022-12-13 20:49:50,301 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-12-13 20:49:50,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 416 conjuncts, 132 conjunts are in the unsatisfiable core [2022-12-13 20:49:50,315 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-12-13 20:49:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2022-12-13 20:49:50,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-12-13 20:49:59,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2914 backedges. 0 proven. 1457 refuted. 0 times theorem prover too weak. 1457 trivial. 0 not checked. [2022-12-13 20:49:59,625 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185157075] provided 0 perfect and 2 imperfect interpolant sequences [2022-12-13 20:49:59,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-12-13 20:49:59,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [67, 67, 67] total 133 [2022-12-13 20:49:59,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557187913] [2022-12-13 20:49:59,626 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-12-13 20:49:59,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 133 states [2022-12-13 20:49:59,627 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 20:49:59,628 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2022-12-13 20:49:59,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=2252, Invalid=15304, Unknown=0, NotChecked=0, Total=17556 [2022-12-13 20:49:59,631 INFO L87 Difference]: Start difference. First operand 105 states and 106 transitions. Second operand has 133 states, 133 states have (on average 1.0451127819548873) internal successors, (139), 69 states have internal predecessors, (139), 1 states have call successors, (2), 1 states have call predecessors, (2), 64 states have return successors, (64), 64 states have call predecessors, (64), 1 states have call successors, (64) [2022-12-13 20:50:03,488 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 1000 (mod (+ |c_id_#t~ret4| 27) 4294967296))) (not (= 1000 (mod (+ 22 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 26 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 7 |c_id_#t~ret4|) 4294967296))) (not (= 1000 (mod (+ 31 |c_id_#t~ret4|) 4294967296))) (not (= 1000 (mod (+ 8 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 5 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 12 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 3 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ |c_id_#t~ret4| 24) 4294967296) 1000)) (not (= 1000 (mod (+ 25 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 20 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 14 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 10 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 6 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 15 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 23 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 30 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ |c_id_#t~ret4| 1) 4294967296))) (not (= (mod (+ 4 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 28 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 11 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 21 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 19 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 16 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 2 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 17 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 13 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 29 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 9 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 18 |c_id_#t~ret4|) 4294967296)))) is different from false [2022-12-13 20:53:27,760 WARN L233 SmtUtils]: Spent 1.72m on a formula simplification that was a NOOP. DAG size: 157 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:53:30,322 WARN L837 $PredicateComparison]: unable to prove that (and (not (= 1000 (mod (+ |c_id_#t~ret4| 27) 4294967296))) (not (= 1000 (mod (+ 22 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 26 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 7 |c_id_#t~ret4|) 4294967296))) (not (= 1000 (mod (+ 8 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 5 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 12 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 3 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ |c_id_#t~ret4| 24) 4294967296) 1000)) (not (= 1000 (mod (+ 25 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 20 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 14 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 10 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 6 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 15 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 23 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 30 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ |c_id_#t~ret4| 1) 4294967296))) (not (= (mod (+ 4 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 28 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 11 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 21 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 19 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 16 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 2 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 17 |c_id_#t~ret4|) 4294967296) 1000)) (not (= (mod (+ 13 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 29 |c_id_#t~ret4|) 4294967296))) (not (= (mod (+ 9 |c_id_#t~ret4|) 4294967296) 1000)) (not (= 1000 (mod (+ 18 |c_id_#t~ret4|) 4294967296)))) is different from false [2022-12-13 20:56:44,244 WARN L233 SmtUtils]: Spent 1.46m on a formula simplification that was a NOOP. DAG size: 152 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-12-13 20:56:45,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-12-13 20:59:37,586 WARN L233 SmtUtils]: Spent 1.51m on a formula simplification that was a NOOP. DAG size: 149 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)