./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8 --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 64bit --witnessprinter.graph.data.programhash 2f44fa11a1dd7d51d0d358dc0be8599fc2c4344e45a49d551a2296ddeb6ce8ad --- 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-e04fb08 [2022-11-16 11:25:17,342 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:25:17,344 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:25:17,364 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:25:17,365 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:25:17,366 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:25:17,367 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:25:17,369 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:25:17,371 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:25:17,372 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:25:17,373 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:25:17,375 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:25:17,375 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:25:17,376 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:25:17,378 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:25:17,379 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:25:17,380 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:25:17,381 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:25:17,383 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:25:17,385 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:25:17,387 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:25:17,388 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:25:17,390 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:25:17,391 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:25:17,394 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:25:17,395 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:25:17,395 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:25:17,396 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:25:17,397 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:25:17,398 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:25:17,398 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:25:17,399 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:25:17,400 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:25:17,401 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:25:17,402 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:25:17,402 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:25:17,403 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:25:17,403 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:25:17,404 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:25:17,405 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:25:17,405 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:25:17,406 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:25:17,439 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:25:17,441 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:25:17,441 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:25:17,441 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:25:17,442 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:25:17,442 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:25:17,443 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:25:17,443 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:25:17,444 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:25:17,444 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:25:17,445 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:25:17,445 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:25:17,445 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:25:17,445 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:25:17,446 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:25:17,446 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:25:17,446 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:25:17,446 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:25:17,446 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:25:17,446 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:25:17,447 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:25:17,447 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:17,447 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:25:17,447 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:25:17,447 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:25:17,448 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:25:17,448 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:25:17,448 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:25:17,448 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:25:17,448 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:25:17,448 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/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_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f44fa11a1dd7d51d0d358dc0be8599fc2c4344e45a49d551a2296ddeb6ce8ad [2022-11-16 11:25:17,735 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:25:17,755 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:25:17,758 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:25:17,759 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:25:17,760 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:25:17,761 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2022-11-16 11:25:17,848 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/3e5aacf4b/75ce909420574d3a86c58a367853b90e/FLAG95d7a700c [2022-11-16 11:25:18,283 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:25:18,284 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2022-11-16 11:25:18,290 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/3e5aacf4b/75ce909420574d3a86c58a367853b90e/FLAG95d7a700c [2022-11-16 11:25:18,303 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/3e5aacf4b/75ce909420574d3a86c58a367853b90e [2022-11-16 11:25:18,305 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:25:18,307 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:25:18,308 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:18,308 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:25:18,312 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:25:18,318 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,320 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e9da6e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18, skipping insertion in model container [2022-11-16 11:25:18,320 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:25:18,351 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:25:18,497 WARN L229 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_a2f96ab0-6702-43fb-9e05-b1dc621302fb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1117,1130] [2022-11-16 11:25:18,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:18,550 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:25:18,560 WARN L229 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_a2f96ab0-6702-43fb-9e05-b1dc621302fb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1117,1130] [2022-11-16 11:25:18,576 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:18,586 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:25:18,587 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18 WrapperNode [2022-11-16 11:25:18,587 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:18,588 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:18,588 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:25:18,588 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:25:18,596 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,602 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,638 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 100 [2022-11-16 11:25:18,644 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:18,645 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:25:18,645 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:25:18,646 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:25:18,655 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,666 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,674 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,678 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,697 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,699 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,700 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,702 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:25:18,703 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:25:18,703 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:25:18,703 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:25:18,704 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (1/1) ... [2022-11-16 11:25:18,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:18,736 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:18,749 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:25:18,768 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:25:18,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:25:18,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:25:18,898 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:25:18,900 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:25:19,084 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:25:19,091 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:25:19,092 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:25:19,094 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:19 BoogieIcfgContainer [2022-11-16 11:25:19,094 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:25:19,096 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:25:19,096 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:25:19,100 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:25:19,101 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:25:18" (1/3) ... [2022-11-16 11:25:19,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1e57ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:19, skipping insertion in model container [2022-11-16 11:25:19,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:18" (2/3) ... [2022-11-16 11:25:19,102 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b1e57ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:19, skipping insertion in model container [2022-11-16 11:25:19,102 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:19" (3/3) ... [2022-11-16 11:25:19,104 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2022-11-16 11:25:19,122 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:25:19,123 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:25:19,171 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:25:19,186 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;@555b6cb9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:25:19,186 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:25:19,190 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:19,197 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-16 11:25:19,197 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:19,198 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:19,199 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:19,203 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:19,204 INFO L85 PathProgramCache]: Analyzing trace with hash -327482853, now seen corresponding path program 1 times [2022-11-16 11:25:19,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:19,212 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1608407511] [2022-11-16 11:25:19,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:19,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:19,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:19,636 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:19,637 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:19,637 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1608407511] [2022-11-16 11:25:19,638 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1608407511] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:19,638 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:19,639 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:25:19,640 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1758036504] [2022-11-16 11:25:19,641 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:19,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:25:19,646 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:19,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:25:19,704 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:25:19,706 INFO L87 Difference]: Start difference. First operand has 26 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 25 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:19,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:19,782 INFO L93 Difference]: Finished difference Result 70 states and 112 transitions. [2022-11-16 11:25:19,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:25:19,785 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2022-11-16 11:25:19,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:19,793 INFO L225 Difference]: With dead ends: 70 [2022-11-16 11:25:19,794 INFO L226 Difference]: Without dead ends: 46 [2022-11-16 11:25:19,808 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:25:19,811 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 72 mSDsluCounter, 43 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:19,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 83 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:25:19,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-11-16 11:25:19,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 24. [2022-11-16 11:25:19,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.4782608695652173) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:19,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 34 transitions. [2022-11-16 11:25:19,866 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 34 transitions. Word has length 9 [2022-11-16 11:25:19,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:19,866 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 34 transitions. [2022-11-16 11:25:19,867 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:19,867 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 34 transitions. [2022-11-16 11:25:19,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-16 11:25:19,868 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:19,868 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:19,868 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:25:19,868 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:19,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:19,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1560249297, now seen corresponding path program 1 times [2022-11-16 11:25:19,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:19,870 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1531919480] [2022-11-16 11:25:19,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:19,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:19,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,202 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:20,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:20,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1531919480] [2022-11-16 11:25:20,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1531919480] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:20,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:20,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:25:20,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626107442] [2022-11-16 11:25:20,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:20,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:25:20,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:20,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:25:20,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:25:20,206 INFO L87 Difference]: Start difference. First operand 24 states and 34 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:20,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:20,286 INFO L93 Difference]: Finished difference Result 77 states and 114 transitions. [2022-11-16 11:25:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:25:20,287 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-16 11:25:20,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:20,288 INFO L225 Difference]: With dead ends: 77 [2022-11-16 11:25:20,288 INFO L226 Difference]: Without dead ends: 55 [2022-11-16 11:25:20,289 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:25:20,290 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 63 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:20,291 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 84 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:25:20,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-11-16 11:25:20,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 29. [2022-11-16 11:25:20,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.4642857142857142) internal successors, (41), 28 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:20,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-11-16 11:25:20,299 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 10 [2022-11-16 11:25:20,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:20,299 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-11-16 11:25:20,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:20,300 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-11-16 11:25:20,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:25:20,301 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:20,301 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:20,301 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:25:20,301 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:20,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:20,302 INFO L85 PathProgramCache]: Analyzing trace with hash 1169957730, now seen corresponding path program 1 times [2022-11-16 11:25:20,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:20,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783655908] [2022-11-16 11:25:20,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:20,303 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:20,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,701 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:20,701 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:20,701 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783655908] [2022-11-16 11:25:20,702 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1783655908] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:20,702 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624650136] [2022-11-16 11:25:20,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:20,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:20,703 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:20,709 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:20,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:25:20,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:20,827 WARN L261 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 75 conjunts are in the unsatisfiable core [2022-11-16 11:25:20,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:21,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:21,560 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:22,346 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:22,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624650136] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:22,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:22,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 11, 12] total 26 [2022-11-16 11:25:22,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268715367] [2022-11-16 11:25:22,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:22,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:25:22,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:22,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:25:22,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=183, Invalid=467, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:25:22,360 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:23,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:23,075 INFO L93 Difference]: Finished difference Result 132 states and 198 transitions. [2022-11-16 11:25:23,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-11-16 11:25:23,076 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-11-16 11:25:23,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:23,082 INFO L225 Difference]: With dead ends: 132 [2022-11-16 11:25:23,083 INFO L226 Difference]: Without dead ends: 110 [2022-11-16 11:25:23,085 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 453 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=603, Invalid=1289, Unknown=0, NotChecked=0, Total=1892 [2022-11-16 11:25:23,089 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 856 mSDsluCounter, 160 mSDsCounter, 0 mSdLazyCounter, 311 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 856 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 311 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:23,091 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [856 Valid, 189 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 311 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:25:23,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-11-16 11:25:23,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 36. [2022-11-16 11:25:23,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:23,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2022-11-16 11:25:23,107 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 23 [2022-11-16 11:25:23,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:23,108 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2022-11-16 11:25:23,108 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.3076923076923075) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:23,109 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-11-16 11:25:23,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-11-16 11:25:23,110 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:23,110 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:23,120 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:25:23,315 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:23,315 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:23,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:23,316 INFO L85 PathProgramCache]: Analyzing trace with hash -1507380838, now seen corresponding path program 1 times [2022-11-16 11:25:23,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:23,317 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1976145358] [2022-11-16 11:25:23,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:23,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:23,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:23,676 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:23,676 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:23,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1976145358] [2022-11-16 11:25:23,676 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1976145358] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:25:23,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413148304] [2022-11-16 11:25:23,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:23,677 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:23,677 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:23,678 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:25:23,706 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:25:23,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:23,758 WARN L261 TraceCheckSpWp]: Trace formula consists of 142 conjuncts, 91 conjunts are in the unsatisfiable core [2022-11-16 11:25:23,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:24,220 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:24,220 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:25,231 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:25,232 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413148304] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:25,232 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:25:25,232 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 11, 14] total 27 [2022-11-16 11:25:25,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642413729] [2022-11-16 11:25:25,235 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:25,236 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-11-16 11:25:25,237 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-11-16 11:25:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=536, Unknown=0, NotChecked=0, Total=702 [2022-11-16 11:25:25,240 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:27,033 INFO L93 Difference]: Finished difference Result 276 states and 399 transitions. [2022-11-16 11:25:27,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2022-11-16 11:25:27,034 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-11-16 11:25:27,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:27,037 INFO L225 Difference]: With dead ends: 276 [2022-11-16 11:25:27,037 INFO L226 Difference]: Without dead ends: 242 [2022-11-16 11:25:27,038 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 994 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=1167, Invalid=2739, Unknown=0, NotChecked=0, Total=3906 [2022-11-16 11:25:27,039 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 1143 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1143 SdHoareTripleChecker+Valid, 60 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:27,040 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1143 Valid, 60 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 552 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-11-16 11:25:27,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 242 states. [2022-11-16 11:25:27,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 242 to 36. [2022-11-16 11:25:27,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.457142857142857) internal successors, (51), 35 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 51 transitions. [2022-11-16 11:25:27,058 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 51 transitions. Word has length 24 [2022-11-16 11:25:27,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:27,059 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 51 transitions. [2022-11-16 11:25:27,059 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 2.4444444444444446) internal successors, (66), 27 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,060 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 51 transitions. [2022-11-16 11:25:27,061 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:25:27,061 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:27,061 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:27,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:27,268 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:25:27,268 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:27,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:27,269 INFO L85 PathProgramCache]: Analyzing trace with hash -441908584, now seen corresponding path program 1 times [2022-11-16 11:25:27,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:27,269 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225872738] [2022-11-16 11:25:27,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:27,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:27,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:27,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:27,470 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225872738] [2022-11-16 11:25:27,471 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225872738] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:27,471 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:27,471 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-16 11:25:27,471 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499848771] [2022-11-16 11:25:27,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:27,472 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:25:27,472 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:27,472 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:25:27,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-11-16 11:25:27,473 INFO L87 Difference]: Start difference. First operand 36 states and 51 transitions. Second operand has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:27,615 INFO L93 Difference]: Finished difference Result 146 states and 206 transitions. [2022-11-16 11:25:27,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:25:27,617 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 11:25:27,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:27,618 INFO L225 Difference]: With dead ends: 146 [2022-11-16 11:25:27,618 INFO L226 Difference]: Without dead ends: 112 [2022-11-16 11:25:27,619 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-11-16 11:25:27,620 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 70 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:27,620 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 117 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:25:27,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2022-11-16 11:25:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 56. [2022-11-16 11:25:27,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4363636363636363) internal successors, (79), 55 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 79 transitions. [2022-11-16 11:25:27,629 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 79 transitions. Word has length 25 [2022-11-16 11:25:27,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:27,630 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 79 transitions. [2022-11-16 11:25:27,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.166666666666667) internal successors, (25), 6 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,630 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 79 transitions. [2022-11-16 11:25:27,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:25:27,631 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:27,631 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:27,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-16 11:25:27,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:27,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:27,632 INFO L85 PathProgramCache]: Analyzing trace with hash -834935594, now seen corresponding path program 1 times [2022-11-16 11:25:27,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:27,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751372049] [2022-11-16 11:25:27,633 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:27,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:27,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:27,874 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:27,874 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:25:27,874 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751372049] [2022-11-16 11:25:27,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751372049] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:27,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:27,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:25:27,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624764017] [2022-11-16 11:25:27,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:27,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:25:27,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:25:27,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:25:27,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:25:27,877 INFO L87 Difference]: Start difference. First operand 56 states and 79 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:27,939 INFO L93 Difference]: Finished difference Result 114 states and 162 transitions. [2022-11-16 11:25:27,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:25:27,940 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-11-16 11:25:27,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:27,941 INFO L225 Difference]: With dead ends: 114 [2022-11-16 11:25:27,941 INFO L226 Difference]: Without dead ends: 75 [2022-11-16 11:25:27,942 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:25:27,942 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 47 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:27,943 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 68 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:25:27,944 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-11-16 11:25:27,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 56. [2022-11-16 11:25:27,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 55 states have (on average 1.4181818181818182) internal successors, (78), 55 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 78 transitions. [2022-11-16 11:25:27,951 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 78 transitions. Word has length 25 [2022-11-16 11:25:27,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:27,952 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 78 transitions. [2022-11-16 11:25:27,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:27,952 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 78 transitions. [2022-11-16 11:25:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-11-16 11:25:27,953 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:27,953 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:27,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-16 11:25:27,953 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:27,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:27,954 INFO L85 PathProgramCache]: Analyzing trace with hash -2114799272, now seen corresponding path program 1 times [2022-11-16 11:25:27,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:25:27,954 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553859744] [2022-11-16 11:25:27,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:27,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:25:27,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:25:27,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:25:28,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:25:28,042 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:25:28,043 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:25:28,044 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:25:28,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:25:28,049 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:28,053 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:25:28,083 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:28,084 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:28,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:25:28 BoogieIcfgContainer [2022-11-16 11:25:28,093 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:25:28,093 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:25:28,093 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:25:28,094 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:25:28,094 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:19" (3/4) ... [2022-11-16 11:25:28,097 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:25:28,098 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:25:28,098 INFO L158 Benchmark]: Toolchain (without parser) took 9791.76ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 91.4MB in the beginning and 138.6MB in the end (delta: -47.1MB). Peak memory consumption was 49.4MB. Max. memory is 16.1GB. [2022-11-16 11:25:28,099 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:25:28,099 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.16ms. Allocated memory is still 130.0MB. Free memory was 91.2MB in the beginning and 104.0MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:25:28,099 INFO L158 Benchmark]: Boogie Procedure Inliner took 56.44ms. Allocated memory is still 130.0MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:25:28,100 INFO L158 Benchmark]: Boogie Preprocessor took 57.04ms. Allocated memory is still 130.0MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:25:28,100 INFO L158 Benchmark]: RCFGBuilder took 391.46ms. Allocated memory is still 130.0MB. Free memory was 100.8MB in the beginning and 87.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:25:28,101 INFO L158 Benchmark]: TraceAbstraction took 8996.67ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 87.2MB in the beginning and 139.6MB in the end (delta: -52.4MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. [2022-11-16 11:25:28,101 INFO L158 Benchmark]: Witness Printer took 4.40ms. Allocated memory is still 226.5MB. Free memory was 139.6MB in the beginning and 138.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:25:28,103 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 130.0MB. Free memory is still 108.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.16ms. Allocated memory is still 130.0MB. Free memory was 91.2MB in the beginning and 104.0MB in the end (delta: -12.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 56.44ms. Allocated memory is still 130.0MB. Free memory was 104.0MB in the beginning and 102.5MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 57.04ms. Allocated memory is still 130.0MB. Free memory was 102.5MB in the beginning and 100.8MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 391.46ms. Allocated memory is still 130.0MB. Free memory was 100.8MB in the beginning and 87.8MB in the end (delta: 13.0MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 8996.67ms. Allocated memory was 130.0MB in the beginning and 226.5MB in the end (delta: 96.5MB). Free memory was 87.2MB in the beginning and 139.6MB in the end (delta: -52.4MB). Peak memory consumption was 45.7MB. Max. memory is 16.1GB. * Witness Printer took 4.40ms. Allocated memory is still 226.5MB. Free memory was 139.6MB in the beginning and 138.6MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 21]: Unable to prove that call to reach_error is unreachable Unable to prove that call to reach_error is unreachable Reason: overapproximation of bitwiseComplement at line 76, overapproximation of bitwiseAnd at line 59. Possible FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L32] const SORT_2 var_4 = 0; [L33] const SORT_2 var_9 = 1; [L34] const SORT_2 var_16 = mask_SORT_2; [L36] SORT_1 input_3; [L38] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L41] SORT_2 init_7_arg_1 = var_4; [L42] state_5 = init_7_arg_1 [L43] SORT_2 init_8_arg_1 = var_4; [L44] state_6 = init_8_arg_1 VAL [init_7_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L60] var_19 = var_19 & mask_SORT_1 VAL [init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L62] RET __VERIFIER_assert(!(bad_20_arg_0)) [L64] SORT_2 var_10_arg_0 = state_5; [L65] SORT_2 var_10_arg_1 = var_9; [L66] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L67] SORT_1 var_12_arg_0 = input_3; [L68] SORT_2 var_12_arg_1 = state_5; [L69] SORT_2 var_12_arg_2 = var_10; [L70] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L71] var_12 = var_12 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L72] SORT_2 next_14_arg_1 = var_12; [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_9; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = ~input_3; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L77] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13_arg_0=0, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L78] SORT_2 var_13_arg_1 = state_6; [L79] SORT_2 var_13_arg_2 = var_11; [L80] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L81] var_13 = var_13 & mask_SORT_2 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, state_5=0, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=3, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L82] SORT_2 next_15_arg_1 = var_13; [L84] state_5 = next_14_arg_1 [L85] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=3, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=3, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=3, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=1, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L60] var_19 = var_19 & mask_SORT_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=3, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=1, var_19_arg_0=1, var_19_arg_1=1, var_4=0, var_9=1] [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 26 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 8.9s, OverallIterations: 7, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2251 SdHoareTripleChecker+Valid, 1.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2251 mSDsluCounter, 601 SdHoareTripleChecker+Invalid, 0.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 430 mSDsCounter, 52 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1012 IncrementalHoareTripleChecker+Invalid, 1064 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 52 mSolverCounterUnsat, 171 mSDtfsCounter, 1012 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 182 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 119 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1448 ImplicationChecksByTransitivity, 2.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=56occurred in iteration=5, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 403 StatesRemovedByMinimization, 6 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.7s InterpolantComputationTime, 188 NumberOfCodeBlocks, 188 NumberOfCodeBlocksAsserted, 9 NumberOfCheckSat, 200 ConstructedInterpolants, 0 QuantifiedInterpolants, 2099 SizeOfPredicates, 69 NumberOfNonLiveVariables, 281 ConjunctsInSsa, 166 ConjunctsInUnsatCore, 10 InterpolantComputations, 4 PerfectInterpolantSequences, 28/48 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2022-11-16 11:25:28,130 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8 --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 64bit --witnessprinter.graph.data.programhash 2f44fa11a1dd7d51d0d358dc0be8599fc2c4344e45a49d551a2296ddeb6ce8ad --- 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-e04fb08 [2022-11-16 11:25:30,535 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:25:30,538 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:25:30,575 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:25:30,576 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:25:30,580 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:25:30,582 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:25:30,598 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:25:30,601 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:25:30,606 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:25:30,608 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:25:30,611 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:25:30,611 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:25:30,614 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:25:30,616 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:25:30,617 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:25:30,619 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:25:30,621 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:25:30,627 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:25:30,634 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:25:30,637 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:25:30,638 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:25:30,641 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:25:30,642 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:25:30,652 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:25:30,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:25:30,653 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:25:30,655 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:25:30,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:25:30,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:25:30,657 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:25:30,657 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:25:30,659 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:25:30,660 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:25:30,661 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:25:30,662 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:25:30,663 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:25:30,663 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:25:30,663 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:25:30,665 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:25:30,666 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:25:30,671 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 11:25:30,716 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:25:30,716 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:25:30,717 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:25:30,717 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:25:30,718 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:25:30,718 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:25:30,720 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:25:30,720 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:25:30,720 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:25:30,721 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:25:30,722 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:25:30,722 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:25:30,722 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:25:30,723 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:25:30,723 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:25:30,723 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:25:30,724 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:25:30,724 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:25:30,724 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:25:30,724 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:25:30,724 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:25:30,725 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:25:30,725 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:25:30,725 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:30,725 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:25:30,726 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:25:30,726 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:25:30,726 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:25:30,727 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:25:30,727 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:25:30,727 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:25:30,727 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:25:30,728 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:25:30,728 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/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_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 2f44fa11a1dd7d51d0d358dc0be8599fc2c4344e45a49d551a2296ddeb6ce8ad [2022-11-16 11:25:31,084 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:25:31,105 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:25:31,108 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:25:31,109 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:25:31,110 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:25:31,112 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2022-11-16 11:25:31,179 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/812a376bf/5d2dd1a8bf834c9c9662e0551a141170/FLAGbfd1e7f8a [2022-11-16 11:25:31,627 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:25:31,631 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c [2022-11-16 11:25:31,639 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/812a376bf/5d2dd1a8bf834c9c9662e0551a141170/FLAGbfd1e7f8a [2022-11-16 11:25:32,039 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/data/812a376bf/5d2dd1a8bf834c9c9662e0551a141170 [2022-11-16 11:25:32,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:25:32,044 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:25:32,048 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:32,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:25:32,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:25:32,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,056 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52b682fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32, skipping insertion in model container [2022-11-16 11:25:32,056 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,064 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:25:32,088 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:25:32,240 WARN L229 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_a2f96ab0-6702-43fb-9e05-b1dc621302fb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1117,1130] [2022-11-16 11:25:32,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:32,304 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:25:32,325 WARN L229 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_a2f96ab0-6702-43fb-9e05-b1dc621302fb/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2.c[1117,1130] [2022-11-16 11:25:32,339 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:25:32,352 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:25:32,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32 WrapperNode [2022-11-16 11:25:32,353 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:25:32,354 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:32,354 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:25:32,354 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:25:32,361 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,385 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,417 INFO L138 Inliner]: procedures = 11, calls = 3, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 65 [2022-11-16 11:25:32,417 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:25:32,418 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:25:32,418 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:25:32,418 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:25:32,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,427 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,439 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,440 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,460 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,461 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,467 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,469 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:25:32,474 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:25:32,474 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:25:32,475 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:25:32,475 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (1/1) ... [2022-11-16 11:25:32,482 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:25:32,493 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:25:32,513 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:25:32,531 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:25:32,556 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:25:32,557 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:25:32,649 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:25:32,652 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:25:32,844 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:25:32,852 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:25:32,852 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:25:32,864 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:32 BoogieIcfgContainer [2022-11-16 11:25:32,865 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:25:32,867 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:25:32,867 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:25:32,870 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:25:32,871 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:25:32" (1/3) ... [2022-11-16 11:25:32,871 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cedc8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:32, skipping insertion in model container [2022-11-16 11:25:32,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:25:32" (2/3) ... [2022-11-16 11:25:32,872 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4cedc8c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:25:32, skipping insertion in model container [2022-11-16 11:25:32,872 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:32" (3/3) ... [2022-11-16 11:25:32,874 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2.c [2022-11-16 11:25:32,893 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:25:32,893 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:25:32,967 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:25:32,975 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;@23d253ac, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:25:32,975 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:25:32,980 INFO L276 IsEmpty]: Start isEmpty. Operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:32,986 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-11-16 11:25:32,987 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:32,988 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-11-16 11:25:32,988 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:32,994 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:32,994 INFO L85 PathProgramCache]: Analyzing trace with hash 28698761, now seen corresponding path program 1 times [2022-11-16 11:25:33,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:25:33,006 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [994906914] [2022-11-16 11:25:33,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:33,007 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:33,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:25:33,009 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:25:33,012 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-11-16 11:25:33,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:33,080 WARN L261 TraceCheckSpWp]: Trace formula consists of 29 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:25:33,087 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:33,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:33,274 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:25:33,275 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:25:33,276 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [994906914] [2022-11-16 11:25:33,276 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [994906914] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:25:33,277 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:25:33,277 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:25:33,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005976353] [2022-11-16 11:25:33,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:25:33,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:25:33,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:25:33,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:25:33,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:25:33,343 INFO L87 Difference]: Start difference. First operand has 11 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:33,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:33,443 INFO L93 Difference]: Finished difference Result 20 states and 30 transitions. [2022-11-16 11:25:33,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:25:33,446 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2022-11-16 11:25:33,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:33,468 INFO L225 Difference]: With dead ends: 20 [2022-11-16 11:25:33,470 INFO L226 Difference]: Without dead ends: 11 [2022-11-16 11:25:33,474 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:25:33,481 INFO L413 NwaCegarLoop]: 5 mSDtfsCounter, 4 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 13 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:33,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 13 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:25:33,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2022-11-16 11:25:33,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 9. [2022-11-16 11:25:33,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 1.125) internal successors, (9), 8 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:33,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-16 11:25:33,519 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 5 [2022-11-16 11:25:33,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:33,519 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-16 11:25:33,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 4 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:33,520 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-16 11:25:33,520 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-16 11:25:33,520 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:33,520 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:25:33,537 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-11-16 11:25:33,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:33,727 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:33,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:33,728 INFO L85 PathProgramCache]: Analyzing trace with hash 271073635, now seen corresponding path program 1 times [2022-11-16 11:25:33,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:25:33,729 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109288747] [2022-11-16 11:25:33,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:25:33,729 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:33,729 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:25:33,731 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:25:33,734 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-11-16 11:25:33,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:25:33,797 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:25:33,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:34,155 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:34,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:34,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:34,460 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:25:34,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109288747] [2022-11-16 11:25:34,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109288747] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:34,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:25:34,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-16 11:25:34,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [98713976] [2022-11-16 11:25:34,461 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:34,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:25:34,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:25:34,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:25:34,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:25:34,464 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:34,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:34,549 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2022-11-16 11:25:34,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:25:34,549 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-11-16 11:25:34,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:34,550 INFO L225 Difference]: With dead ends: 16 [2022-11-16 11:25:34,550 INFO L226 Difference]: Without dead ends: 14 [2022-11-16 11:25:34,551 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:25:34,554 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 19 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 8 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:34,554 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 19 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 8 Unchecked, 0.0s Time] [2022-11-16 11:25:34,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2022-11-16 11:25:34,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 12. [2022-11-16 11:25:34,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.0909090909090908) internal successors, (12), 11 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:34,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2022-11-16 11:25:34,569 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 8 [2022-11-16 11:25:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:34,572 INFO L495 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2022-11-16 11:25:34,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:34,573 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2022-11-16 11:25:34,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-11-16 11:25:34,578 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:34,578 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1] [2022-11-16 11:25:34,597 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:34,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:34,790 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:34,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:34,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1020920393, now seen corresponding path program 2 times [2022-11-16 11:25:34,791 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:25:34,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62895175] [2022-11-16 11:25:34,792 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:25:34,792 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:34,793 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:25:34,794 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:25:34,814 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-11-16 11:25:34,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:25:34,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:25:34,886 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 11:25:34,891 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:35,195 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:35,196 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:35,598 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:35,599 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:25:35,599 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62895175] [2022-11-16 11:25:35,600 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62895175] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:35,603 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:25:35,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-16 11:25:35,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584832004] [2022-11-16 11:25:35,604 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:35,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:25:35,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:25:35,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:25:35,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:25:35,608 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:35,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:35,750 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-11-16 11:25:35,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:25:35,751 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-11-16 11:25:35,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:35,752 INFO L225 Difference]: With dead ends: 19 [2022-11-16 11:25:35,752 INFO L226 Difference]: Without dead ends: 17 [2022-11-16 11:25:35,752 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-11-16 11:25:35,754 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 23 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:35,754 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 23 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 13 Unchecked, 0.0s Time] [2022-11-16 11:25:35,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-16 11:25:35,760 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 15. [2022-11-16 11:25:35,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 14 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:35,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2022-11-16 11:25:35,761 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 11 [2022-11-16 11:25:35,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:35,762 INFO L495 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2022-11-16 11:25:35,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.0) internal successors, (20), 10 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:35,763 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2022-11-16 11:25:35,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-11-16 11:25:35,763 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:35,763 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1] [2022-11-16 11:25:35,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:35,974 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:35,975 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:35,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:35,976 INFO L85 PathProgramCache]: Analyzing trace with hash 1580781475, now seen corresponding path program 3 times [2022-11-16 11:25:35,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:25:35,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1929487679] [2022-11-16 11:25:35,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:25:35,977 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:35,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:25:35,978 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:25:35,984 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-11-16 11:25:36,069 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:25:36,070 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:25:36,073 WARN L261 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 66 conjunts are in the unsatisfiable core [2022-11-16 11:25:36,079 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:38,265 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:39,809 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:39,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:25:39,810 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1929487679] [2022-11-16 11:25:39,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1929487679] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:39,813 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:25:39,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-11-16 11:25:39,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [566967236] [2022-11-16 11:25:39,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:39,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-16 11:25:39,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:25:39,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-16 11:25:39,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:25:39,817 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:40,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:40,156 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2022-11-16 11:25:40,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:25:40,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-11-16 11:25:40,157 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:40,157 INFO L225 Difference]: With dead ends: 22 [2022-11-16 11:25:40,158 INFO L226 Difference]: Without dead ends: 20 [2022-11-16 11:25:40,158 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=83, Invalid=157, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:25:40,159 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 25 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 24 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:40,159 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 24 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 17 Unchecked, 0.0s Time] [2022-11-16 11:25:40,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-11-16 11:25:40,167 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2022-11-16 11:25:40,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.0588235294117647) internal successors, (18), 17 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:40,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-16 11:25:40,169 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2022-11-16 11:25:40,170 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:40,170 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-16 11:25:40,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.1666666666666665) internal successors, (26), 12 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:40,170 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-16 11:25:40,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:25:40,178 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:40,178 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 1, 1, 1, 1] [2022-11-16 11:25:40,195 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:40,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:40,390 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:40,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:40,391 INFO L85 PathProgramCache]: Analyzing trace with hash -1250702327, now seen corresponding path program 4 times [2022-11-16 11:25:40,391 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:25:40,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [957956912] [2022-11-16 11:25:40,392 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:25:40,392 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:40,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:25:40,393 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:25:40,404 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-11-16 11:25:40,474 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:25:40,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:25:40,479 WARN L261 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 95 conjunts are in the unsatisfiable core [2022-11-16 11:25:40,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:25:43,060 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:43,060 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:25:52,808 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:25:52,809 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:25:52,809 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [957956912] [2022-11-16 11:25:52,809 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [957956912] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:25:52,809 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:25:52,810 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-11-16 11:25:52,810 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307894299] [2022-11-16 11:25:52,810 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:25:52,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-11-16 11:25:52,811 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:25:52,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-11-16 11:25:52,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-11-16 11:25:52,812 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:53,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:25:53,595 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2022-11-16 11:25:53,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-16 11:25:53,595 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-11-16 11:25:53,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:25:53,596 INFO L225 Difference]: With dead ends: 28 [2022-11-16 11:25:53,596 INFO L226 Difference]: Without dead ends: 26 [2022-11-16 11:25:53,597 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 5.4s TimeCoverageRelationStatistics Valid=139, Invalid=323, Unknown=0, NotChecked=0, Total=462 [2022-11-16 11:25:53,598 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 32 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 30 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-16 11:25:53,598 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 30 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 38 Invalid, 0 Unknown, 14 Unchecked, 0.2s Time] [2022-11-16 11:25:53,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-11-16 11:25:53,606 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 24. [2022-11-16 11:25:53,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 23 states have (on average 1.0434782608695652) internal successors, (24), 23 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:53,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2022-11-16 11:25:53,607 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2022-11-16 11:25:53,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:25:53,608 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2022-11-16 11:25:53,608 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 2.0) internal successors, (32), 16 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:25:53,608 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2022-11-16 11:25:53,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-11-16 11:25:53,609 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:25:53,609 INFO L195 NwaCegarLoop]: trace histogram [7, 6, 6, 1, 1, 1, 1] [2022-11-16 11:25:53,625 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:53,824 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:53,825 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:25:53,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:25:53,825 INFO L85 PathProgramCache]: Analyzing trace with hash 142558665, now seen corresponding path program 5 times [2022-11-16 11:25:53,826 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:25:53,826 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1009464381] [2022-11-16 11:25:53,826 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:25:53,826 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:53,827 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:25:53,827 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-11-16 11:25:53,829 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-11-16 11:25:53,940 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 7 check-sat command(s) [2022-11-16 11:25:53,940 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:25:53,941 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:25:53,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:25:54,061 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:25:54,061 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:25:54,062 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:25:54,082 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:25:54,272 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2022-11-16 11:25:54,275 INFO L444 BasicCegarLoop]: Path program histogram: [5, 1] [2022-11-16 11:25:54,278 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:25:54,309 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,309 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,309 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,309 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,309 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,310 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,310 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:25:54 BoogieIcfgContainer [2022-11-16 11:25:54,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:25:54,323 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:25:54,324 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:25:54,324 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:25:54,324 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:25:32" (3/4) ... [2022-11-16 11:25:54,326 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:25:54,340 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,340 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,340 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,341 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,341 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,341 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,341 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:25:54,413 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:25:54,413 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:25:54,413 INFO L158 Benchmark]: Toolchain (without parser) took 22369.03ms. Allocated memory was 62.9MB in the beginning and 251.7MB in the end (delta: 188.7MB). Free memory was 41.2MB in the beginning and 228.7MB in the end (delta: -187.5MB). Peak memory consumption was 149.3MB. Max. memory is 16.1GB. [2022-11-16 11:25:54,414 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 48.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:25:54,414 INFO L158 Benchmark]: CACSL2BoogieTranslator took 304.83ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 46.3MB in the end (delta: -5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 11:25:54,414 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.42ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:25:54,415 INFO L158 Benchmark]: Boogie Preprocessor took 55.38ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 43.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:25:54,415 INFO L158 Benchmark]: RCFGBuilder took 390.80ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 32.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:25:54,416 INFO L158 Benchmark]: TraceAbstraction took 21456.19ms. Allocated memory was 62.9MB in the beginning and 251.7MB in the end (delta: 188.7MB). Free memory was 32.1MB in the beginning and 87.7MB in the end (delta: -55.6MB). Peak memory consumption was 135.5MB. Max. memory is 16.1GB. [2022-11-16 11:25:54,416 INFO L158 Benchmark]: Witness Printer took 89.45ms. Allocated memory is still 251.7MB. Free memory was 87.7MB in the beginning and 228.7MB in the end (delta: -141.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-11-16 11:25:54,418 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.32ms. Allocated memory is still 62.9MB. Free memory was 43.6MB in the beginning and 43.6MB in the end (delta: 48.3kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 304.83ms. Allocated memory is still 62.9MB. Free memory was 41.0MB in the beginning and 46.3MB in the end (delta: -5.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.42ms. Allocated memory is still 62.9MB. Free memory was 46.3MB in the beginning and 44.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.38ms. Allocated memory is still 62.9MB. Free memory was 44.8MB in the beginning and 43.5MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 390.80ms. Allocated memory is still 62.9MB. Free memory was 43.5MB in the beginning and 32.6MB in the end (delta: 10.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 21456.19ms. Allocated memory was 62.9MB in the beginning and 251.7MB in the end (delta: 188.7MB). Free memory was 32.1MB in the beginning and 87.7MB in the end (delta: -55.6MB). Peak memory consumption was 135.5MB. Max. memory is 16.1GB. * Witness Printer took 89.45ms. Allocated memory is still 251.7MB. Free memory was 87.7MB in the beginning and 228.7MB in the end (delta: -141.0MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 21]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L26] const SORT_1 mask_SORT_1 = (SORT_1)-1 >> (sizeof(SORT_1) * 8 - 1); [L27] const SORT_1 msb_SORT_1 = (SORT_1)1 << (1 - 1); [L29] const SORT_2 mask_SORT_2 = (SORT_2)-1 >> (sizeof(SORT_2) * 8 - 2); [L30] const SORT_2 msb_SORT_2 = (SORT_2)1 << (2 - 1); [L32] const SORT_2 var_4 = 0; [L33] const SORT_2 var_9 = 1; [L34] const SORT_2 var_16 = mask_SORT_2; [L36] SORT_1 input_3; [L38] SORT_2 state_5 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L41] SORT_2 init_7_arg_1 = var_4; [L42] state_5 = init_7_arg_1 [L43] SORT_2 init_8_arg_1 = var_4; [L44] state_6 = init_8_arg_1 VAL [init_7_arg_1=0, init_8_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_5=0, state_6=0, var_16=3, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L60] var_19 = var_19 & mask_SORT_1 [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L62] RET __VERIFIER_assert(!(bad_20_arg_0)) [L64] SORT_2 var_10_arg_0 = state_5; [L65] SORT_2 var_10_arg_1 = var_9; [L66] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L67] SORT_1 var_12_arg_0 = input_3; [L68] SORT_2 var_12_arg_1 = state_5; [L69] SORT_2 var_12_arg_2 = var_10; [L70] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L71] var_12 = var_12 & mask_SORT_2 [L72] SORT_2 next_14_arg_1 = var_12; [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_9; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = ~input_3; [L77] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L78] SORT_2 var_13_arg_1 = state_6; [L79] SORT_2 var_13_arg_2 = var_11; [L80] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L81] var_13 = var_13 & mask_SORT_2 [L82] SORT_2 next_15_arg_1 = var_13; [L84] state_5 = next_14_arg_1 [L85] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=1, next_15_arg_1=0, state_5=1, state_6=0, var_10=1, var_10_arg_0=0, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=1, var_12_arg_0=0, var_12_arg_1=0, var_12_arg_2=1, var_13=0, var_13_arg_0=1, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=0, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L60] var_19 = var_19 & mask_SORT_1 [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L62] RET __VERIFIER_assert(!(bad_20_arg_0)) [L64] SORT_2 var_10_arg_0 = state_5; [L65] SORT_2 var_10_arg_1 = var_9; [L66] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L67] SORT_1 var_12_arg_0 = input_3; [L68] SORT_2 var_12_arg_1 = state_5; [L69] SORT_2 var_12_arg_2 = var_10; [L70] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L71] var_12 = var_12 & mask_SORT_2 [L72] SORT_2 next_14_arg_1 = var_12; [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_9; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = ~input_3; [L77] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L78] SORT_2 var_13_arg_1 = state_6; [L79] SORT_2 var_13_arg_2 = var_11; [L80] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L81] var_13 = var_13 & mask_SORT_2 [L82] SORT_2 next_15_arg_1 = var_13; [L84] state_5 = next_14_arg_1 [L85] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=2, next_15_arg_1=0, state_5=2, state_6=0, var_10=2, var_10_arg_0=1, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=0, var_12_arg_1=1, var_12_arg_2=2, var_13=0, var_13_arg_0=1, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=1, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L60] var_19 = var_19 & mask_SORT_1 [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L62] RET __VERIFIER_assert(!(bad_20_arg_0)) [L64] SORT_2 var_10_arg_0 = state_5; [L65] SORT_2 var_10_arg_1 = var_9; [L66] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L67] SORT_1 var_12_arg_0 = input_3; [L68] SORT_2 var_12_arg_1 = state_5; [L69] SORT_2 var_12_arg_2 = var_10; [L70] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L71] var_12 = var_12 & mask_SORT_2 [L72] SORT_2 next_14_arg_1 = var_12; [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_9; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = ~input_3; [L77] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L78] SORT_2 var_13_arg_1 = state_6; [L79] SORT_2 var_13_arg_2 = var_11; [L80] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L81] var_13 = var_13 & mask_SORT_2 [L82] SORT_2 next_15_arg_1 = var_13; [L84] state_5 = next_14_arg_1 [L85] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=0, state_5=3, state_6=0, var_10=3, var_10_arg_0=2, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=0, var_12_arg_1=2, var_12_arg_2=3, var_13=0, var_13_arg_0=1, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=0, var_17_arg_0=2, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=0, var_19_arg_1=0, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L60] var_19 = var_19 & mask_SORT_1 [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L62] RET __VERIFIER_assert(!(bad_20_arg_0)) [L64] SORT_2 var_10_arg_0 = state_5; [L65] SORT_2 var_10_arg_1 = var_9; [L66] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L67] SORT_1 var_12_arg_0 = input_3; [L68] SORT_2 var_12_arg_1 = state_5; [L69] SORT_2 var_12_arg_2 = var_10; [L70] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L71] var_12 = var_12 & mask_SORT_2 [L72] SORT_2 next_14_arg_1 = var_12; [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_9; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = ~input_3; [L77] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L78] SORT_2 var_13_arg_1 = state_6; [L79] SORT_2 var_13_arg_2 = var_11; [L80] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L81] var_13 = var_13 & mask_SORT_2 [L82] SORT_2 next_15_arg_1 = var_13; [L84] state_5 = next_14_arg_1 [L85] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=1, state_5=3, state_6=1, var_10=4, var_10_arg_0=3, var_10_arg_1=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=3, var_12_arg_0=1, var_12_arg_1=3, var_12_arg_2=4, var_13=1, var_13_arg_0=0, var_13_arg_1=0, var_13_arg_2=1, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=0, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=0, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L60] var_19 = var_19 & mask_SORT_1 [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L62] RET __VERIFIER_assert(!(bad_20_arg_0)) [L64] SORT_2 var_10_arg_0 = state_5; [L65] SORT_2 var_10_arg_1 = var_9; [L66] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L67] SORT_1 var_12_arg_0 = input_3; [L68] SORT_2 var_12_arg_1 = state_5; [L69] SORT_2 var_12_arg_2 = var_10; [L70] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L71] var_12 = var_12 & mask_SORT_2 [L72] SORT_2 next_14_arg_1 = var_12; [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_9; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = ~input_3; [L77] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L78] SORT_2 var_13_arg_1 = state_6; [L79] SORT_2 var_13_arg_2 = var_11; [L80] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L81] var_13 = var_13 & mask_SORT_2 [L82] SORT_2 next_15_arg_1 = var_13; [L84] state_5 = next_14_arg_1 [L85] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=2, state_5=3, state_6=2, var_10=4, var_10_arg_0=3, var_10_arg_1=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=3, var_12_arg_0=1, var_12_arg_1=3, var_12_arg_2=4, var_13=2, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=2, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=1, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=0, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L60] var_19 = var_19 & mask_SORT_1 [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L62] RET __VERIFIER_assert(!(bad_20_arg_0)) [L64] SORT_2 var_10_arg_0 = state_5; [L65] SORT_2 var_10_arg_1 = var_9; [L66] SORT_2 var_10 = var_10_arg_0 + var_10_arg_1; [L67] SORT_1 var_12_arg_0 = input_3; [L68] SORT_2 var_12_arg_1 = state_5; [L69] SORT_2 var_12_arg_2 = var_10; [L70] SORT_2 var_12 = var_12_arg_0 ? var_12_arg_1 : var_12_arg_2; [L71] var_12 = var_12 & mask_SORT_2 [L72] SORT_2 next_14_arg_1 = var_12; [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_9; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = ~input_3; [L77] var_13_arg_0 = var_13_arg_0 & mask_SORT_1 [L78] SORT_2 var_13_arg_1 = state_6; [L79] SORT_2 var_13_arg_2 = var_11; [L80] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L81] var_13 = var_13 & mask_SORT_2 [L82] SORT_2 next_15_arg_1 = var_13; [L84] state_5 = next_14_arg_1 [L85] state_6 = next_15_arg_1 VAL [bad_20_arg_0=0, init_7_arg_1=0, init_8_arg_1=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_14_arg_1=3, next_15_arg_1=3, state_5=3, state_6=3, var_10=4, var_10_arg_0=3, var_10_arg_1=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=1, var_12_arg_1=3, var_12_arg_2=4, var_13=3, var_13_arg_0=0, var_13_arg_1=2, var_13_arg_2=3, var_16=3, var_17=1, var_17_arg_0=3, var_17_arg_1=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=1, var_19_arg_1=0, var_4=0, var_9=1] [L47] input_3 = __VERIFIER_nondet_uchar() [L48] input_3 = input_3 & mask_SORT_1 [L51] SORT_2 var_17_arg_0 = state_5; [L52] SORT_2 var_17_arg_1 = var_16; [L53] SORT_1 var_17 = var_17_arg_0 == var_17_arg_1; [L54] SORT_2 var_18_arg_0 = state_6; [L55] SORT_2 var_18_arg_1 = var_16; [L56] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L57] SORT_1 var_19_arg_0 = var_17; [L58] SORT_1 var_19_arg_1 = var_18; [L59] SORT_1 var_19 = var_19_arg_0 & var_19_arg_1; [L60] var_19 = var_19 & mask_SORT_1 [L61] SORT_1 bad_20_arg_0 = var_19; [L62] CALL __VERIFIER_assert(!(bad_20_arg_0)) [L21] COND TRUE !(cond) VAL [\old(cond)=0, cond=0] [L21] reach_error() VAL [\old(cond)=0, cond=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 11 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 21.3s, OverallIterations: 6, TraceHistogramMax: 7, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 87 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 87 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 52 IncrementalHoareTripleChecker+Unchecked, 88 mSDsCounter, 13 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 93 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 13 mSolverCounterUnsat, 21 mSDtfsCounter, 93 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 112 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 7.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=24occurred in iteration=5, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 17.7s InterpolantComputationTime, 78 NumberOfCodeBlocks, 78 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 96 ConstructedInterpolants, 18 QuantifiedInterpolants, 17786 SizeOfPredicates, 226 NumberOfNonLiveVariables, 465 ConjunctsInSsa, 232 ConjunctsInUnsatCore, 9 InterpolantComputations, 1 PerfectInterpolantSequences, 0/100 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:25:54,443 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a2f96ab0-6702-43fb-9e05-b1dc621302fb/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE