./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e04fb08f Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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_69108aa1-3040-4de7-88aa-0d36813e849c/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 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 --- 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:20:13,473 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:20:13,475 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:20:13,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:20:13,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:20:13,515 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:20:13,518 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:20:13,522 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:20:13,525 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:20:13,531 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:20:13,532 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:20:13,535 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:20:13,535 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:20:13,538 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:20:13,539 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:20:13,542 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:20:13,544 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:20:13,545 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:20:13,546 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:20:13,556 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:20:13,558 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:20:13,559 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:20:13,562 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:20:13,563 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:20:13,572 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:20:13,572 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:20:13,573 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:20:13,574 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:20:13,575 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:20:13,576 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:20:13,577 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:20:13,578 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:20:13,580 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:20:13,582 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:20:13,584 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:20:13,585 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:20:13,586 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:20:13,586 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:20:13,586 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:20:13,587 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:20:13,588 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:20:13,589 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Default.epf [2022-11-16 11:20:13,636 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:20:13,637 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:20:13,638 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:20:13,638 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:20:13,639 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:20:13,639 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:20:13,640 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:20:13,640 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:20:13,641 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:20:13,641 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:20:13,642 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:20:13,642 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:20:13,642 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:20:13,643 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:20:13,643 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:20:13,643 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:20:13,643 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:20:13,644 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:20:13,644 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:20:13,644 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:20:13,644 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:20:13,645 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:20:13,645 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:20:13,645 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:20:13,645 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:20:13,646 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:20:13,647 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-16 11:20:13,648 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:20:13,648 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:20:13,648 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:20:13,648 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_69108aa1-3040-4de7-88aa-0d36813e849c/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_69108aa1-3040-4de7-88aa-0d36813e849c/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 -> 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 [2022-11-16 11:20:13,981 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:20:14,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:20:14,011 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:20:14,013 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:20:14,014 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:20:14,015 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-16 11:20:14,098 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/287461ba1/59e24355fa924d2e9484fc6d99eb929b/FLAG21e94586a [2022-11-16 11:20:14,609 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:20:14,610 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-16 11:20:14,622 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/287461ba1/59e24355fa924d2e9484fc6d99eb929b/FLAG21e94586a [2022-11-16 11:20:14,962 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/287461ba1/59e24355fa924d2e9484fc6d99eb929b [2022-11-16 11:20:14,967 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:20:14,970 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:20:14,976 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:20:14,977 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:20:14,981 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:20:14,982 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:20:14" (1/1) ... [2022-11-16 11:20:14,984 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@60a1c334 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:14, skipping insertion in model container [2022-11-16 11:20:14,985 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:20:14" (1/1) ... [2022-11-16 11:20:14,993 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:20:15,015 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:20:15,231 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_69108aa1-3040-4de7-88aa-0d36813e849c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-16 11:20:15,289 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:20:15,293 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:20:15,304 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_69108aa1-3040-4de7-88aa-0d36813e849c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-16 11:20:15,320 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:20:15,332 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:20:15,333 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15 WrapperNode [2022-11-16 11:20:15,333 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:20:15,334 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:20:15,334 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:20:15,334 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:20:15,342 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:20:15" (1/1) ... [2022-11-16 11:20:15,349 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:20:15" (1/1) ... [2022-11-16 11:20:15,373 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 119 [2022-11-16 11:20:15,373 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:20:15,374 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:20:15,374 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:20:15,374 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:20:15,384 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,384 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,386 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,386 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,392 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,398 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,399 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,401 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:20:15,402 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:20:15,402 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:20:15,402 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:20:15,403 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (1/1) ... [2022-11-16 11:20:15,409 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:20:15,421 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:15,434 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:15,460 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:20:15,487 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:20:15,487 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:20:15,561 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:20:15,563 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:20:15,808 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:20:15,815 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:20:15,815 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:20:15,817 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:15 BoogieIcfgContainer [2022-11-16 11:20:15,818 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:20:15,820 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:20:15,820 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:20:15,824 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:20:15,824 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:20:14" (1/3) ... [2022-11-16 11:20:15,825 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51969d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:20:15, skipping insertion in model container [2022-11-16 11:20:15,825 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:15" (2/3) ... [2022-11-16 11:20:15,826 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51969d1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:20:15, skipping insertion in model container [2022-11-16 11:20:15,826 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:15" (3/3) ... [2022-11-16 11:20:15,827 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2022-11-16 11:20:15,847 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:20:15,847 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:20:15,899 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:20:15,906 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;@4513424c, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:20:15,906 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:20:15,911 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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:20:15,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:20:15,931 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:15,932 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:15,932 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:15,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:15,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1914165743, now seen corresponding path program 1 times [2022-11-16 11:20:15,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:15,972 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [437715011] [2022-11-16 11:20:15,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:15,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:16,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:16,245 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:20:16,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:16,247 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [437715011] [2022-11-16 11:20:16,248 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [437715011] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:16,248 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:16,248 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:20:16,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024616108] [2022-11-16 11:20:16,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:16,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:20:16,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:16,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:20:16,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:20:16,304 INFO L87 Difference]: Start difference. First operand has 31 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:20:16,330 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:16,331 INFO L93 Difference]: Finished difference Result 56 states and 87 transitions. [2022-11-16 11:20:16,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:20:16,333 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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) Word has length 15 [2022-11-16 11:20:16,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:16,343 INFO L225 Difference]: With dead ends: 56 [2022-11-16 11:20:16,343 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 11:20:16,349 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:20:16,355 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:16,357 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:20:16,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 11:20:16,402 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-11-16 11:20:16,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.5) internal successors, (39), 26 states have internal predecessors, (39), 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:20:16,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 39 transitions. [2022-11-16 11:20:16,410 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 39 transitions. Word has length 15 [2022-11-16 11:20:16,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:16,411 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 39 transitions. [2022-11-16 11:20:16,412 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 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:20:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 39 transitions. [2022-11-16 11:20:16,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-16 11:20:16,413 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:16,413 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:16,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-16 11:20:16,414 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:16,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:16,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1856907441, now seen corresponding path program 1 times [2022-11-16 11:20:16,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:16,420 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026422851] [2022-11-16 11:20:16,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:16,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:16,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:16,833 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:20:16,833 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:16,834 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026422851] [2022-11-16 11:20:16,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026422851] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:16,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:16,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:20:16,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123052276] [2022-11-16 11:20:16,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:16,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:20:16,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:16,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:20:16,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:20:16,838 INFO L87 Difference]: Start difference. First operand 27 states and 39 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:20:16,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:16,910 INFO L93 Difference]: Finished difference Result 66 states and 96 transitions. [2022-11-16 11:20:16,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:20:16,911 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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) Word has length 15 [2022-11-16 11:20:16,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:16,913 INFO L225 Difference]: With dead ends: 66 [2022-11-16 11:20:16,913 INFO L226 Difference]: Without dead ends: 64 [2022-11-16 11:20:16,913 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:20:16,915 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 93 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 133 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:20:16,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 133 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:20:16,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-11-16 11:20:16,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 29. [2022-11-16 11:20:16,921 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:20:16,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 41 transitions. [2022-11-16 11:20:16,923 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 41 transitions. Word has length 15 [2022-11-16 11:20:16,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:16,923 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 41 transitions. [2022-11-16 11:20:16,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 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:20:16,924 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 41 transitions. [2022-11-16 11:20:16,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-16 11:20:16,925 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:16,925 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:16,925 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-16 11:20:16,926 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:16,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:16,927 INFO L85 PathProgramCache]: Analyzing trace with hash -1727830820, now seen corresponding path program 1 times [2022-11-16 11:20:16,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:16,927 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1798859861] [2022-11-16 11:20:16,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:16,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:16,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:17,201 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:20:17,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:17,201 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1798859861] [2022-11-16 11:20:17,201 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1798859861] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:17,202 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:17,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:20:17,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327487278] [2022-11-16 11:20:17,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:17,203 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:20:17,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:17,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:20:17,204 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:20:17,204 INFO L87 Difference]: Start difference. First operand 29 states and 41 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:20:17,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:17,282 INFO L93 Difference]: Finished difference Result 97 states and 142 transitions. [2022-11-16 11:20:17,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:20:17,283 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 16 [2022-11-16 11:20:17,283 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:17,284 INFO L225 Difference]: With dead ends: 97 [2022-11-16 11:20:17,284 INFO L226 Difference]: Without dead ends: 70 [2022-11-16 11:20:17,285 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:20:17,286 INFO L413 NwaCegarLoop]: 53 mSDtfsCounter, 66 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:17,287 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 119 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:20:17,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-16 11:20:17,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 42. [2022-11-16 11:20:17,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4634146341463414) internal successors, (60), 41 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:20:17,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 60 transitions. [2022-11-16 11:20:17,295 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 60 transitions. Word has length 16 [2022-11-16 11:20:17,296 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:17,296 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 60 transitions. [2022-11-16 11:20:17,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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:20:17,296 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 60 transitions. [2022-11-16 11:20:17,297 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-11-16 11:20:17,297 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:17,298 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:17,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-16 11:20:17,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:17,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:17,299 INFO L85 PathProgramCache]: Analyzing trace with hash 1227717594, now seen corresponding path program 1 times [2022-11-16 11:20:17,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:17,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [327726845] [2022-11-16 11:20:17,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:17,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:17,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:17,756 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:17,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:17,756 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [327726845] [2022-11-16 11:20:17,757 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [327726845] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:17,757 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468719982] [2022-11-16 11:20:17,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:17,758 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:17,758 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:17,764 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:20:17,784 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-16 11:20:17,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:17,874 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:20:17,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:18,019 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-11-16 11:20:18,019 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:20:18,019 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468719982] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:18,019 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:20:18,020 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [7] total 11 [2022-11-16 11:20:18,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [648667075] [2022-11-16 11:20:18,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:18,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-16 11:20:18,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:18,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-16 11:20:18,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:20:18,022 INFO L87 Difference]: Start difference. First operand 42 states and 60 transitions. Second operand has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:20:18,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:18,131 INFO L93 Difference]: Finished difference Result 101 states and 143 transitions. [2022-11-16 11:20:18,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-16 11:20:18,132 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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 33 [2022-11-16 11:20:18,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:18,134 INFO L225 Difference]: With dead ends: 101 [2022-11-16 11:20:18,134 INFO L226 Difference]: Without dead ends: 70 [2022-11-16 11:20:18,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:20:18,136 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 58 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:18,137 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 144 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:20:18,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-16 11:20:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 47. [2022-11-16 11:20:18,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 46 states have (on average 1.4565217391304348) internal successors, (67), 46 states have internal predecessors, (67), 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:20:18,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 67 transitions. [2022-11-16 11:20:18,150 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 67 transitions. Word has length 33 [2022-11-16 11:20:18,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:18,150 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 67 transitions. [2022-11-16 11:20:18,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.166666666666667) internal successors, (31), 6 states have internal predecessors, (31), 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:20:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 67 transitions. [2022-11-16 11:20:18,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-11-16 11:20:18,151 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:18,152 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:18,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-16 11:20:18,352 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:18,353 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:18,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:18,354 INFO L85 PathProgramCache]: Analyzing trace with hash 268514058, now seen corresponding path program 1 times [2022-11-16 11:20:18,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:18,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1771984397] [2022-11-16 11:20:18,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:18,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:18,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:18,734 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 11 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:18,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1771984397] [2022-11-16 11:20:18,735 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1771984397] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:18,735 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [667593404] [2022-11-16 11:20:18,736 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:18,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:18,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:18,740 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:20:18,771 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-16 11:20:18,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:18,841 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:20:18,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:19,026 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:19,026 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:20:19,064 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-11-16 11:20:19,064 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [667593404] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:19,064 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:20:19,064 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6, 9] total 14 [2022-11-16 11:20:19,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [643968365] [2022-11-16 11:20:19,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:19,066 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:20:19,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:19,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:20:19,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=149, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:20:19,072 INFO L87 Difference]: Start difference. First operand 47 states and 67 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:20:19,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:19,103 INFO L93 Difference]: Finished difference Result 80 states and 112 transitions. [2022-11-16 11:20:19,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-16 11:20:19,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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 34 [2022-11-16 11:20:19,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:19,109 INFO L225 Difference]: With dead ends: 80 [2022-11-16 11:20:19,114 INFO L226 Difference]: Without dead ends: 47 [2022-11-16 11:20:19,115 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 41 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-11-16 11:20:19,121 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 1 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:19,121 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 108 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:20:19,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-11-16 11:20:19,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 42. [2022-11-16 11:20:19,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.4146341463414633) internal successors, (58), 41 states have internal predecessors, (58), 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:20:19,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 58 transitions. [2022-11-16 11:20:19,131 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 58 transitions. Word has length 34 [2022-11-16 11:20:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:19,132 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 58 transitions. [2022-11-16 11:20:19,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 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:20:19,132 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 58 transitions. [2022-11-16 11:20:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-11-16 11:20:19,135 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:19,135 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:19,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:19,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:19,336 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:19,337 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:19,337 INFO L85 PathProgramCache]: Analyzing trace with hash 230661950, now seen corresponding path program 1 times [2022-11-16 11:20:19,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:19,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849312697] [2022-11-16 11:20:19,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:19,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:19,657 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:19,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:19,658 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849312697] [2022-11-16 11:20:19,660 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1849312697] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:19,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1356266348] [2022-11-16 11:20:19,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:19,662 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:19,662 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:19,664 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:20:19,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-16 11:20:19,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:19,760 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 49 conjunts are in the unsatisfiable core [2022-11-16 11:20:19,763 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:20,126 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:20,126 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:20:20,513 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:20,514 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1356266348] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:20:20,514 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:20:20,514 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 9, 8] total 20 [2022-11-16 11:20:20,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631906616] [2022-11-16 11:20:20,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:20:20,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:20:20,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:20,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:20:20,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:20:20,516 INFO L87 Difference]: Start difference. First operand 42 states and 58 transitions. Second operand has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 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:20:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:21,392 INFO L93 Difference]: Finished difference Result 185 states and 265 transitions. [2022-11-16 11:20:21,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:20:21,393 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 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 35 [2022-11-16 11:20:21,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:21,394 INFO L225 Difference]: With dead ends: 185 [2022-11-16 11:20:21,394 INFO L226 Difference]: Without dead ends: 158 [2022-11-16 11:20:21,395 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=364, Invalid=968, Unknown=0, NotChecked=0, Total=1332 [2022-11-16 11:20:21,396 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 1059 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 382 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1059 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 396 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 382 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:21,397 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1059 Valid, 274 Invalid, 396 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 382 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-16 11:20:21,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2022-11-16 11:20:21,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 46. [2022-11-16 11:20:21,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.4222222222222223) internal successors, (64), 45 states have internal predecessors, (64), 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:20:21,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 64 transitions. [2022-11-16 11:20:21,405 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 64 transitions. Word has length 35 [2022-11-16 11:20:21,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:21,406 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 64 transitions. [2022-11-16 11:20:21,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 4.85) internal successors, (97), 20 states have internal predecessors, (97), 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:20:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 64 transitions. [2022-11-16 11:20:21,407 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:20:21,407 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:21,407 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:21,418 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:21,613 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-11-16 11:20:21,614 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:21,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:21,614 INFO L85 PathProgramCache]: Analyzing trace with hash -345792303, now seen corresponding path program 1 times [2022-11-16 11:20:21,615 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:21,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549842485] [2022-11-16 11:20:21,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:21,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:21,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:21,820 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:21,821 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:21,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549842485] [2022-11-16 11:20:21,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549842485] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:21,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:21,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-16 11:20:21,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1705074238] [2022-11-16 11:20:21,822 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:21,822 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-16 11:20:21,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:21,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-16 11:20:21,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-11-16 11:20:21,823 INFO L87 Difference]: Start difference. First operand 46 states and 64 transitions. Second operand has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:20:21,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:21,921 INFO L93 Difference]: Finished difference Result 155 states and 216 transitions. [2022-11-16 11:20:21,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:20:21,921 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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 36 [2022-11-16 11:20:21,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:21,922 INFO L225 Difference]: With dead ends: 155 [2022-11-16 11:20:21,922 INFO L226 Difference]: Without dead ends: 111 [2022-11-16 11:20:21,923 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-11-16 11:20:21,923 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 113 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:21,924 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 111 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:20:21,925 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-11-16 11:20:21,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 63. [2022-11-16 11:20:21,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.3870967741935485) internal successors, (86), 62 states have internal predecessors, (86), 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:20:21,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 86 transitions. [2022-11-16 11:20:21,931 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 86 transitions. Word has length 36 [2022-11-16 11:20:21,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:21,931 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 86 transitions. [2022-11-16 11:20:21,931 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 7.2) internal successors, (36), 5 states have internal predecessors, (36), 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:20:21,931 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 86 transitions. [2022-11-16 11:20:21,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-11-16 11:20:21,932 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:21,932 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:21,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-16 11:20:21,933 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:21,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:21,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2034736045, now seen corresponding path program 1 times [2022-11-16 11:20:21,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:21,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326080953] [2022-11-16 11:20:21,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:21,934 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:21,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:22,234 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:22,234 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326080953] [2022-11-16 11:20:22,235 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326080953] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:22,235 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744515150] [2022-11-16 11:20:22,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:22,235 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:22,237 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:22,240 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:20:22,260 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-16 11:20:22,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:22,319 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 30 conjunts are in the unsatisfiable core [2022-11-16 11:20:22,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:22,474 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:22,475 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:20:22,475 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744515150] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:22,475 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:20:22,475 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [6] total 12 [2022-11-16 11:20:22,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5153154] [2022-11-16 11:20:22,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:22,477 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:20:22,479 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:22,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:20:22,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-11-16 11:20:22,480 INFO L87 Difference]: Start difference. First operand 63 states and 86 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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:20:22,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:22,593 INFO L93 Difference]: Finished difference Result 159 states and 220 transitions. [2022-11-16 11:20:22,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:20:22,594 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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 36 [2022-11-16 11:20:22,594 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:22,595 INFO L225 Difference]: With dead ends: 159 [2022-11-16 11:20:22,595 INFO L226 Difference]: Without dead ends: 114 [2022-11-16 11:20:22,596 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:20:22,596 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 129 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 159 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:22,597 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 159 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:20:22,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-11-16 11:20:22,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 74. [2022-11-16 11:20:22,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 73 states have (on average 1.3424657534246576) internal successors, (98), 73 states have internal predecessors, (98), 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:20:22,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 98 transitions. [2022-11-16 11:20:22,604 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 98 transitions. Word has length 36 [2022-11-16 11:20:22,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:22,604 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 98 transitions. [2022-11-16 11:20:22,605 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 8 states have internal predecessors, (36), 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:20:22,605 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 98 transitions. [2022-11-16 11:20:22,606 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 11:20:22,606 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:22,606 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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:20:22,621 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:22,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:22,813 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:22,813 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:22,813 INFO L85 PathProgramCache]: Analyzing trace with hash 1391148479, now seen corresponding path program 1 times [2022-11-16 11:20:22,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:22,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398576876] [2022-11-16 11:20:22,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:22,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:22,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:23,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:23,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:23,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398576876] [2022-11-16 11:20:23,110 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398576876] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:23,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1899949685] [2022-11-16 11:20:23,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:23,111 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:23,116 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:23,117 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:20:23,122 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-16 11:20:23,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:23,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 26 conjunts are in the unsatisfiable core [2022-11-16 11:20:23,199 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:23,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:23,318 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:20:23,318 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1899949685] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:23,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-16 11:20:23,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [6] total 11 [2022-11-16 11:20:23,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268446366] [2022-11-16 11:20:23,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:23,319 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-16 11:20:23,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:23,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-16 11:20:23,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2022-11-16 11:20:23,321 INFO L87 Difference]: Start difference. First operand 74 states and 98 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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:20:23,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:23,407 INFO L93 Difference]: Finished difference Result 149 states and 203 transitions. [2022-11-16 11:20:23,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-16 11:20:23,407 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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 37 [2022-11-16 11:20:23,408 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:23,408 INFO L225 Difference]: With dead ends: 149 [2022-11-16 11:20:23,408 INFO L226 Difference]: Without dead ends: 104 [2022-11-16 11:20:23,411 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2022-11-16 11:20:23,413 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 115 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:23,414 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 163 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:20:23,414 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-11-16 11:20:23,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 62. [2022-11-16 11:20:23,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 61 states have (on average 1.3770491803278688) internal successors, (84), 61 states have internal predecessors, (84), 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:20:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 84 transitions. [2022-11-16 11:20:23,435 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 84 transitions. Word has length 37 [2022-11-16 11:20:23,435 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:23,435 INFO L495 AbstractCegarLoop]: Abstraction has 62 states and 84 transitions. [2022-11-16 11:20:23,436 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 7 states have internal predecessors, (37), 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:20:23,436 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 84 transitions. [2022-11-16 11:20:23,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 11:20:23,441 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:23,441 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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:20:23,452 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:23,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2022-11-16 11:20:23,642 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:23,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:23,643 INFO L85 PathProgramCache]: Analyzing trace with hash -14132907, now seen corresponding path program 1 times [2022-11-16 11:20:23,643 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:23,643 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104363726] [2022-11-16 11:20:23,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:23,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:23,865 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:23,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:23,866 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104363726] [2022-11-16 11:20:23,866 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104363726] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:23,866 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:23,866 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:20:23,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [140456723] [2022-11-16 11:20:23,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:23,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:20:23,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:23,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:20:23,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:20:23,868 INFO L87 Difference]: Start difference. First operand 62 states and 84 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:20:23,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:23,936 INFO L93 Difference]: Finished difference Result 146 states and 201 transitions. [2022-11-16 11:20:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:20:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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 37 [2022-11-16 11:20:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:23,938 INFO L225 Difference]: With dead ends: 146 [2022-11-16 11:20:23,938 INFO L226 Difference]: Without dead ends: 102 [2022-11-16 11:20:23,938 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:20:23,939 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 46 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 100 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.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:23,941 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 100 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-16 11:20:23,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-11-16 11:20:23,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 78. [2022-11-16 11:20:23,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 77 states have (on average 1.3636363636363635) internal successors, (105), 77 states have internal predecessors, (105), 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:20:23,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 105 transitions. [2022-11-16 11:20:23,951 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 105 transitions. Word has length 37 [2022-11-16 11:20:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:23,952 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 105 transitions. [2022-11-16 11:20:23,952 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 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:20:23,952 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 105 transitions. [2022-11-16 11:20:23,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 11:20:23,954 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:23,954 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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:20:23,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-16 11:20:23,955 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:23,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:23,955 INFO L85 PathProgramCache]: Analyzing trace with hash -1703076649, now seen corresponding path program 1 times [2022-11-16 11:20:23,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:23,956 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229191082] [2022-11-16 11:20:23,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:23,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:23,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:24,222 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:24,223 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:20:24,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229191082] [2022-11-16 11:20:24,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229191082] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-16 11:20:24,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1533529786] [2022-11-16 11:20:24,223 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:24,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:24,224 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:24,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-16 11:20:24,247 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-16 11:20:24,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:24,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 86 conjunts are in the unsatisfiable core [2022-11-16 11:20:24,320 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:24,994 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:24,994 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:20:25,939 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:25,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1533529786] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:20:25,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-16 11:20:25,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 15, 13] total 30 [2022-11-16 11:20:25,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888102806] [2022-11-16 11:20:25,940 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-16 11:20:25,941 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2022-11-16 11:20:25,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:20:25,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2022-11-16 11:20:25,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=235, Invalid=635, Unknown=0, NotChecked=0, Total=870 [2022-11-16 11:20:25,942 INFO L87 Difference]: Start difference. First operand 78 states and 105 transitions. Second operand has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 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:20:27,028 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:27,028 INFO L93 Difference]: Finished difference Result 461 states and 616 transitions. [2022-11-16 11:20:27,029 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-11-16 11:20:27,029 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 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 37 [2022-11-16 11:20:27,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:27,032 INFO L225 Difference]: With dead ends: 461 [2022-11-16 11:20:27,033 INFO L226 Difference]: Without dead ends: 417 [2022-11-16 11:20:27,034 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 803 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=987, Invalid=2205, Unknown=0, NotChecked=0, Total=3192 [2022-11-16 11:20:27,035 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 1645 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 606 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1645 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 606 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:27,036 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1645 Valid, 306 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 606 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-11-16 11:20:27,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 417 states. [2022-11-16 11:20:27,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 417 to 121. [2022-11-16 11:20:27,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.3083333333333333) internal successors, (157), 120 states have internal predecessors, (157), 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:20:27,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 157 transitions. [2022-11-16 11:20:27,047 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 157 transitions. Word has length 37 [2022-11-16 11:20:27,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:27,048 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 157 transitions. [2022-11-16 11:20:27,048 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 3.433333333333333) internal successors, (103), 30 states have internal predecessors, (103), 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:20:27,048 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 157 transitions. [2022-11-16 11:20:27,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-11-16 11:20:27,049 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:27,049 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:27,056 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:27,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-16 11:20:27,255 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:27,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash -200748836, now seen corresponding path program 1 times [2022-11-16 11:20:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:20:27,256 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1933609682] [2022-11-16 11:20:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:20:27,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:27,332 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:20:27,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:20:27,428 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:20:27,429 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:20:27,430 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:20:27,432 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-16 11:20:27,435 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:27,439 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:20:27,505 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:20:27,510 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:20:27,527 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:20:27 BoogieIcfgContainer [2022-11-16 11:20:27,527 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:20:27,528 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:20:27,528 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:20:27,529 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:20:27,529 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:15" (3/4) ... [2022-11-16 11:20:27,532 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-11-16 11:20:27,532 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:20:27,533 INFO L158 Benchmark]: Toolchain (without parser) took 12563.61ms. Allocated memory was 102.8MB in the beginning and 192.9MB in the end (delta: 90.2MB). Free memory was 59.7MB in the beginning and 143.4MB in the end (delta: -83.7MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-16 11:20:27,534 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 102.8MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:20:27,534 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.83ms. Allocated memory is still 102.8MB. Free memory was 59.5MB in the beginning and 76.6MB in the end (delta: -17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:20:27,534 INFO L158 Benchmark]: Boogie Procedure Inliner took 39.47ms. Allocated memory is still 102.8MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:20:27,534 INFO L158 Benchmark]: Boogie Preprocessor took 26.98ms. Allocated memory is still 102.8MB. Free memory was 74.5MB in the beginning and 73.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:20:27,535 INFO L158 Benchmark]: RCFGBuilder took 416.09ms. Allocated memory is still 102.8MB. Free memory was 73.2MB in the beginning and 59.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-11-16 11:20:27,536 INFO L158 Benchmark]: TraceAbstraction took 11707.62ms. Allocated memory was 102.8MB in the beginning and 192.9MB in the end (delta: 90.2MB). Free memory was 58.6MB in the beginning and 143.4MB in the end (delta: -84.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. [2022-11-16 11:20:27,536 INFO L158 Benchmark]: Witness Printer took 4.72ms. Allocated memory is still 192.9MB. Free memory is still 143.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:20:27,538 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.30ms. Allocated memory is still 102.8MB. Free memory is still 76.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.83ms. Allocated memory is still 102.8MB. Free memory was 59.5MB in the beginning and 76.6MB in the end (delta: -17.1MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 39.47ms. Allocated memory is still 102.8MB. Free memory was 76.6MB in the beginning and 74.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.98ms. Allocated memory is still 102.8MB. Free memory was 74.5MB in the beginning and 73.2MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 416.09ms. Allocated memory is still 102.8MB. Free memory was 73.2MB in the beginning and 59.3MB in the end (delta: 13.9MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 11707.62ms. Allocated memory was 102.8MB in the beginning and 192.9MB in the end (delta: 90.2MB). Free memory was 58.6MB in the beginning and 143.4MB in the end (delta: -84.9MB). Peak memory consumption was 6.6MB. Max. memory is 16.1GB. * Witness Printer took 4.72ms. Allocated memory is still 192.9MB. Free memory is still 143.4MB. 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 55, overapproximation of bitwiseAnd at line 68. 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_5 = 0; [L33] const SORT_2 var_10 = 1; [L34] const SORT_2 var_17 = mask_SORT_2; [L36] SORT_1 input_3; [L37] SORT_1 input_4; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_8_arg_1 = var_5; [L43] state_6 = init_8_arg_1 [L44] SORT_2 init_9_arg_1 = var_5; [L45] state_7 = init_9_arg_1 VAL [init_8_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 VAL [init_8_arg_1=0, init_9_arg_1=0, input_3=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 VAL [init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); VAL [init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L56] var_22 = var_22 & mask_SORT_1 VAL [init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; VAL [constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L69] var_20 = var_20 & mask_SORT_1 VAL [constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_13=1, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L80] var_13 = var_13 & mask_SORT_2 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, state_6=0, state_7=0, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=1, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L89] var_14 = var_14 & mask_SORT_2 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, state_6=0, state_7=0, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=1, var_5=0] [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22_arg_0=0, var_22_arg_1=0, var_5=0] [L56] var_22 = var_22 & mask_SORT_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=0, var_5=0] [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=1, var_19_arg_0=3, var_19_arg_1=3, var_20=1, var_20_arg_0=1, var_20_arg_1=1, var_22=1, var_22_arg_0=0, var_22_arg_1=0, var_5=0] [L69] var_20 = var_20 & mask_SORT_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=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=1, var_13=3, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=3, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=1, var_19_arg_0=3, var_19_arg_1=3, var_20=1, var_20_arg_0=1, var_20_arg_1=1, var_22=1, var_22_arg_0=0, var_22_arg_1=0, var_5=0] [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_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, 31 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 11.6s, OverallIterations: 12, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 3325 SdHoareTripleChecker+Valid, 1.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3325 mSDsluCounter, 1656 SdHoareTripleChecker+Invalid, 1.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1183 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1283 IncrementalHoareTripleChecker+Invalid, 1342 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 473 mSDtfsCounter, 1283 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 423 GetRequests, 272 SyntacticMatches, 0 SemanticMatches, 151 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1216 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=121occurred in iteration=11, InterpolantAutomatonStates: 110, 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, 11 MinimizatonAttempts, 653 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.9s InterpolantComputationTime, 582 NumberOfCodeBlocks, 582 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 629 ConstructedInterpolants, 0 QuantifiedInterpolants, 4278 SizeOfPredicates, 102 NumberOfNonLiveVariables, 1098 ConjunctsInSsa, 251 ConjunctsInUnsatCore, 20 InterpolantComputations, 9 PerfectInterpolantSequences, 158/216 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:20:27,573 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/config/AutomizerReach.xml -i ../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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_69108aa1-3040-4de7-88aa-0d36813e849c/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 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 --- 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:20:29,973 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:20:29,976 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:20:30,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:20:30,018 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:20:30,022 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:20:30,023 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:20:30,028 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:20:30,031 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:20:30,033 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:20:30,035 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:20:30,039 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:20:30,039 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:20:30,044 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:20:30,046 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:20:30,047 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:20:30,049 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:20:30,050 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:20:30,053 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:20:30,057 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:20:30,062 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:20:30,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:20:30,068 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:20:30,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:20:30,073 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:20:30,079 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:20:30,079 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:20:30,080 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:20:30,082 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:20:30,083 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:20:30,083 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:20:30,084 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:20:30,086 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:20:30,088 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:20:30,092 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:20:30,092 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:20:30,093 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:20:30,094 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:20:30,094 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:20:30,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:20:30,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:20:30,101 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/config/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-11-16 11:20:30,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:20:30,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:20:30,150 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:20:30,150 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:20:30,151 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-16 11:20:30,152 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-16 11:20:30,153 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:20:30,154 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:20:30,154 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:20:30,154 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:20:30,155 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:20:30,156 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-16 11:20:30,156 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-16 11:20:30,156 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-16 11:20:30,156 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-16 11:20:30,157 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-11-16 11:20:30,157 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-11-16 11:20:30,157 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:20:30,157 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:20:30,158 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-16 11:20:30,158 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:20:30,158 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:20:30,158 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-16 11:20:30,159 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:20:30,159 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:20:30,159 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-16 11:20:30,159 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-16 11:20:30,160 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-11-16 11:20:30,160 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-11-16 11:20:30,160 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-16 11:20:30,160 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-16 11:20:30,161 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-16 11:20:30,161 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-11-16 11:20:30,161 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_69108aa1-3040-4de7-88aa-0d36813e849c/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_69108aa1-3040-4de7-88aa-0d36813e849c/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 -> 0040318bb7d5d70cc95d7fb363d250bf2184336e92628a243777c547e7400e43 [2022-11-16 11:20:30,587 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:20:30,614 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:20:30,618 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:20:30,619 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:20:30,622 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:20:30,624 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-16 11:20:30,705 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/739cb6917/b38d862548f14bbd99ba8dea154d47ca/FLAG4c0c29511 [2022-11-16 11:20:31,326 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:20:31,327 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c [2022-11-16 11:20:31,335 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/739cb6917/b38d862548f14bbd99ba8dea154d47ca/FLAG4c0c29511 [2022-11-16 11:20:31,682 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/data/739cb6917/b38d862548f14bbd99ba8dea154d47ca [2022-11-16 11:20:31,684 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:20:31,685 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:20:31,689 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:20:31,689 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:20:31,703 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:20:31,704 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:20:31" (1/1) ... [2022-11-16 11:20:31,705 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ed8dad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:31, skipping insertion in model container [2022-11-16 11:20:31,705 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:20:31" (1/1) ... [2022-11-16 11:20:31,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:20:31,738 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:20:31,874 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_69108aa1-3040-4de7-88aa-0d36813e849c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-16 11:20:31,947 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:20:31,958 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:20:31,980 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_69108aa1-3040-4de7-88aa-0d36813e849c/sv-benchmarks/c/hardware-verification-bv/btor2c-lazyMod.twocount2c.c[1117,1130] [2022-11-16 11:20:32,052 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:20:32,069 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:20:32,069 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32 WrapperNode [2022-11-16 11:20:32,070 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:20:32,072 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:20:32,073 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:20:32,073 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:20:32,081 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:20:32" (1/1) ... [2022-11-16 11:20:32,090 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:20:32" (1/1) ... [2022-11-16 11:20:32,127 INFO L138 Inliner]: procedures = 11, calls = 4, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 77 [2022-11-16 11:20:32,127 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:20:32,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:20:32,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:20:32,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:20:32,139 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,139 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,153 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,154 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,167 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,176 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,178 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,184 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,186 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:20:32,189 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:20:32,189 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:20:32,190 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:20:32,190 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (1/1) ... [2022-11-16 11:20:32,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-16 11:20:32,211 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:20:32,230 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-16 11:20:32,239 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-16 11:20:32,274 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:20:32,274 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:20:32,376 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:20:32,379 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:20:32,534 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:20:32,541 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:20:32,542 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:20:32,544 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:32 BoogieIcfgContainer [2022-11-16 11:20:32,544 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:20:32,553 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-16 11:20:32,554 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-16 11:20:32,557 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-16 11:20:32,557 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 11:20:31" (1/3) ... [2022-11-16 11:20:32,558 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe1b6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:20:32, skipping insertion in model container [2022-11-16 11:20:32,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:20:32" (2/3) ... [2022-11-16 11:20:32,559 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@fe1b6ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 11:20:32, skipping insertion in model container [2022-11-16 11:20:32,559 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:32" (3/3) ... [2022-11-16 11:20:32,561 INFO L112 eAbstractionObserver]: Analyzing ICFG btor2c-lazyMod.twocount2c.c [2022-11-16 11:20:32,580 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-16 11:20:32,580 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-16 11:20:32,631 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-16 11:20:32,638 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;@5b515595, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-16 11:20:32,639 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-11-16 11:20:32,643 INFO L276 IsEmpty]: Start isEmpty. Operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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:20:32,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:20:32,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:32,651 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:32,651 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:32,657 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:32,658 INFO L85 PathProgramCache]: Analyzing trace with hash 1809708109, now seen corresponding path program 1 times [2022-11-16 11:20:32,671 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:20:32,671 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1886939624] [2022-11-16 11:20:32,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:32,672 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:20:32,673 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:20:32,680 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:32,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:32,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:32,791 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-16 11:20:32,796 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:32,815 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:20:32,832 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:20:32,833 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:20:32,833 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1886939624] [2022-11-16 11:20:32,834 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1886939624] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:32,834 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:32,834 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:20:32,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450715612] [2022-11-16 11:20:32,839 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:32,857 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-16 11:20:32,857 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:20:32,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-16 11:20:32,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:20:32,922 INFO L87 Difference]: Start difference. First operand has 13 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 12 states have internal predecessors, (16), 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 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:20:32,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:32,939 INFO L93 Difference]: Finished difference Result 20 states and 27 transitions. [2022-11-16 11:20:32,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-16 11:20:32,945 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2022-11-16 11:20:32,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:32,954 INFO L225 Difference]: With dead ends: 20 [2022-11-16 11:20:32,954 INFO L226 Difference]: Without dead ends: 9 [2022-11-16 11:20:32,957 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-16 11:20:32,963 INFO L413 NwaCegarLoop]: 9 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 9 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:32,965 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:20:32,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2022-11-16 11:20:33,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2022-11-16 11:20:33,001 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:20:33,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2022-11-16 11:20:33,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2022-11-16 11:20:33,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:33,005 INFO L495 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2022-11-16 11:20:33,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 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:20:33,005 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2022-11-16 11:20:33,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-11-16 11:20:33,007 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:33,008 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:33,024 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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)] Forceful destruction successful, exit code 0 [2022-11-16 11:20:33,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:33,220 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:33,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:33,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1809767691, now seen corresponding path program 1 times [2022-11-16 11:20:33,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:20:33,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609000276] [2022-11-16 11:20:33,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:33,225 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:20:33,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:20:33,227 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:33,274 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:33,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:33,335 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 15 conjunts are in the unsatisfiable core [2022-11-16 11:20:33,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:33,505 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:20:33,505 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-16 11:20:33,505 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:20:33,506 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609000276] [2022-11-16 11:20:33,506 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609000276] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:20:33,506 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:20:33,507 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-16 11:20:33,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563162073] [2022-11-16 11:20:33,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:20:33,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-16 11:20:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:20:33,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-16 11:20:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-16 11:20:33,510 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:20:33,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:33,554 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2022-11-16 11:20:33,554 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-16 11:20:33,555 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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 7 [2022-11-16 11:20:33,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:33,555 INFO L225 Difference]: With dead ends: 19 [2022-11-16 11:20:33,556 INFO L226 Difference]: Without dead ends: 17 [2022-11-16 11:20:33,556 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:20:33,557 INFO L413 NwaCegarLoop]: 8 mSDtfsCounter, 6 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 18 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:33,558 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 18 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-16 11:20:33,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2022-11-16 11:20:33,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 13. [2022-11-16 11:20:33,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 12 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:20:33,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2022-11-16 11:20:33,563 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 7 [2022-11-16 11:20:33,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:33,564 INFO L495 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2022-11-16 11:20:33,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.75) internal successors, (7), 4 states have internal predecessors, (7), 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:20:33,564 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2022-11-16 11:20:33,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-16 11:20:33,565 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:33,565 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2022-11-16 11:20:33,580 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:33,776 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:33,776 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:33,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:33,777 INFO L85 PathProgramCache]: Analyzing trace with hash -1841040349, now seen corresponding path program 1 times [2022-11-16 11:20:33,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:20:33,778 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [703443024] [2022-11-16 11:20:33,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:20:33,778 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:20:33,778 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:20:33,784 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:33,788 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:33,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:20:33,869 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 24 conjunts are in the unsatisfiable core [2022-11-16 11:20:33,872 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:34,248 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:34,248 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:20:34,673 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:34,673 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:20:34,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [703443024] [2022-11-16 11:20:34,674 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [703443024] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:20:34,675 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:20:34,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-11-16 11:20:34,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902371586] [2022-11-16 11:20:34,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:20:34,679 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-16 11:20:34,680 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:20:34,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-16 11:20:34,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-11-16 11:20:34,683 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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:20:34,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:34,799 INFO L93 Difference]: Finished difference Result 24 states and 24 transitions. [2022-11-16 11:20:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-16 11:20:34,799 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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 12 [2022-11-16 11:20:34,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:34,802 INFO L225 Difference]: With dead ends: 24 [2022-11-16 11:20:34,802 INFO L226 Difference]: Without dead ends: 22 [2022-11-16 11:20:34,803 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 16 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:20:34,806 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 15 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:34,808 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 32 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 20 Invalid, 0 Unknown, 14 Unchecked, 0.1s Time] [2022-11-16 11:20:34,809 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-11-16 11:20:34,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 18. [2022-11-16 11:20:34,816 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:20:34,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2022-11-16 11:20:34,819 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 12 [2022-11-16 11:20:34,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:34,819 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2022-11-16 11:20:34,819 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 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:20:34,820 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2022-11-16 11:20:34,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-16 11:20:34,821 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:34,821 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1] [2022-11-16 11:20:34,832 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:35,032 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:35,032 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:35,033 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:35,033 INFO L85 PathProgramCache]: Analyzing trace with hash 191466507, now seen corresponding path program 2 times [2022-11-16 11:20:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:20:35,034 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [259035135] [2022-11-16 11:20:35,034 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-16 11:20:35,034 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:20:35,035 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:20:35,039 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:35,041 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:35,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-16 11:20:35,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:20:35,157 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 32 conjunts are in the unsatisfiable core [2022-11-16 11:20:35,162 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:35,539 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:35,539 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:20:36,032 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:36,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:20:36,033 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [259035135] [2022-11-16 11:20:36,034 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [259035135] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:20:36,034 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:20:36,034 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-11-16 11:20:36,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188333319] [2022-11-16 11:20:36,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:20:36,035 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-16 11:20:36,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:20:36,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-16 11:20:36,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-11-16 11:20:36,036 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:20:36,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:36,178 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2022-11-16 11:20:36,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-16 11:20:36,179 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:20:36,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:36,181 INFO L225 Difference]: With dead ends: 29 [2022-11-16 11:20:36,181 INFO L226 Difference]: Without dead ends: 27 [2022-11-16 11:20:36,185 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 24 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:20:36,188 INFO L413 NwaCegarLoop]: 6 mSDtfsCounter, 33 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:36,190 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 40 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 21 Invalid, 0 Unknown, 17 Unchecked, 0.1s Time] [2022-11-16 11:20:36,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-11-16 11:20:36,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-11-16 11:20:36,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 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:20:36,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 23 transitions. [2022-11-16 11:20:36,197 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 23 transitions. Word has length 17 [2022-11-16 11:20:36,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:36,198 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 23 transitions. [2022-11-16 11:20:36,198 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.2) internal successors, (32), 10 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:20:36,198 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 23 transitions. [2022-11-16 11:20:36,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-11-16 11:20:36,199 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:36,199 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1] [2022-11-16 11:20:36,210 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:36,404 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:36,404 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:36,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:36,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1190222557, now seen corresponding path program 3 times [2022-11-16 11:20:36,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:20:36,405 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [815999007] [2022-11-16 11:20:36,405 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-16 11:20:36,406 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:20:36,406 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:20:36,412 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:36,413 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:36,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-11-16 11:20:36,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:20:36,514 WARN L261 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 84 conjunts are in the unsatisfiable core [2022-11-16 11:20:36,518 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:38,805 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:38,806 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:20:45,224 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:45,225 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:20:45,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [815999007] [2022-11-16 11:20:45,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [815999007] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:20:45,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:20:45,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-11-16 11:20:45,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882849489] [2022-11-16 11:20:45,226 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:20:45,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-11-16 11:20:45,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:20:45,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-11-16 11:20:45,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=106, Invalid=274, Unknown=0, NotChecked=0, Total=380 [2022-11-16 11:20:45,228 INFO L87 Difference]: Start difference. First operand 23 states and 23 transitions. Second operand has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 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:20:45,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:20:45,789 INFO L93 Difference]: Finished difference Result 30 states and 30 transitions. [2022-11-16 11:20:45,790 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-16 11:20:45,790 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 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 22 [2022-11-16 11:20:45,790 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:20:45,791 INFO L225 Difference]: With dead ends: 30 [2022-11-16 11:20:45,791 INFO L226 Difference]: Without dead ends: 28 [2022-11-16 11:20:45,792 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2022-11-16 11:20:45,792 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 2 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 3 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 3 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:20:45,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 34 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 3 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-11-16 11:20:45,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-11-16 11:20:45,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-11-16 11:20:45,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.037037037037037) internal successors, (28), 27 states have internal predecessors, (28), 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:20:45,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2022-11-16 11:20:45,800 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 22 [2022-11-16 11:20:45,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:20:45,800 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2022-11-16 11:20:45,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.1) internal successors, (42), 20 states have internal predecessors, (42), 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:20:45,801 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2022-11-16 11:20:45,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-11-16 11:20:45,802 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:20:45,802 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1] [2022-11-16 11:20:45,816 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:46,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:46,008 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:20:46,008 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:20:46,009 INFO L85 PathProgramCache]: Analyzing trace with hash -1666876661, now seen corresponding path program 4 times [2022-11-16 11:20:46,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:20:46,010 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2003832154] [2022-11-16 11:20:46,011 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-16 11:20:46,011 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:20:46,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:20:46,012 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:46,014 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:20:46,120 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-16 11:20:46,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:20:46,125 WARN L261 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 119 conjunts are in the unsatisfiable core [2022-11-16 11:20:46,130 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:20:54,670 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:20:54,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:21:25,724 WARN L233 SmtUtils]: Spent 5.57s on a formula simplification. DAG size of input: 622 DAG size of output: 570 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:21:37,303 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:37,303 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:21:37,304 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2003832154] [2022-11-16 11:21:37,304 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2003832154] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:21:37,304 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:21:37,304 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-11-16 11:21:37,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380879766] [2022-11-16 11:21:37,305 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:21:37,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-11-16 11:21:37,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:21:37,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-11-16 11:21:37,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=476, Unknown=0, NotChecked=0, Total=650 [2022-11-16 11:21:37,307 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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:21:38,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:21:38,010 INFO L93 Difference]: Finished difference Result 35 states and 35 transitions. [2022-11-16 11:21:38,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-11-16 11:21:38,011 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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 27 [2022-11-16 11:21:38,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:21:38,012 INFO L225 Difference]: With dead ends: 35 [2022-11-16 11:21:38,012 INFO L226 Difference]: Without dead ends: 33 [2022-11-16 11:21:38,013 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 308 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=294, Invalid=698, Unknown=0, NotChecked=0, Total=992 [2022-11-16 11:21:38,013 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 13 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 31 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 39 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:21:38,014 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 31 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 7 Invalid, 0 Unknown, 39 Unchecked, 0.0s Time] [2022-11-16 11:21:38,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-11-16 11:21:38,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-11-16 11:21:38,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 32 states have (on average 1.03125) internal successors, (33), 32 states have internal predecessors, (33), 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:21:38,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 33 transitions. [2022-11-16 11:21:38,023 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 33 transitions. Word has length 27 [2022-11-16 11:21:38,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:21:38,024 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 33 transitions. [2022-11-16 11:21:38,024 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.0) internal successors, (52), 26 states have internal predecessors, (52), 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:21:38,024 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 33 transitions. [2022-11-16 11:21:38,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-11-16 11:21:38,025 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:21:38,025 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1] [2022-11-16 11:21:38,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:21:38,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:21:38,237 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:21:38,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:21:38,237 INFO L85 PathProgramCache]: Analyzing trace with hash -1963977181, now seen corresponding path program 5 times [2022-11-16 11:21:38,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:21:38,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [312177343] [2022-11-16 11:21:38,238 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-16 11:21:38,238 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:21:38,238 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:21:38,239 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:21:38,270 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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 (8)] Waiting until timeout for monitored process [2022-11-16 11:21:38,371 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-11-16 11:21:38,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-16 11:21:38,382 WARN L261 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 170 conjunts are in the unsatisfiable core [2022-11-16 11:21:38,387 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-16 11:21:48,623 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:21:48,623 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-16 11:22:30,349 WARN L233 SmtUtils]: Spent 6.03s on a formula simplification. DAG size of input: 686 DAG size of output: 560 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:22:49,400 WARN L233 SmtUtils]: Spent 5.66s on a formula simplification. DAG size of input: 558 DAG size of output: 558 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:23:01,360 WARN L233 SmtUtils]: Spent 5.73s on a formula simplification. DAG size of input: 576 DAG size of output: 565 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:23:38,609 WARN L233 SmtUtils]: Spent 15.93s on a formula simplification. DAG size of input: 1102 DAG size of output: 988 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:24:18,957 WARN L233 SmtUtils]: Spent 10.42s on a formula simplification. DAG size of input: 986 DAG size of output: 986 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:24:42,610 WARN L233 SmtUtils]: Spent 10.99s on a formula simplification. DAG size of input: 1004 DAG size of output: 993 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-16 11:24:42,679 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-16 11:24:42,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-11-16 11:24:42,679 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [312177343] [2022-11-16 11:24:42,680 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleMathsat [312177343] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-16 11:24:42,680 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-16 11:24:42,680 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 39 [2022-11-16 11:24:42,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2043020674] [2022-11-16 11:24:42,680 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-16 11:24:42,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-11-16 11:24:42,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-11-16 11:24:42,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-11-16 11:24:42,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=356, Invalid=1126, Unknown=0, NotChecked=0, Total=1482 [2022-11-16 11:24:42,683 INFO L87 Difference]: Start difference. First operand 33 states and 33 transitions. Second operand has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 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:24:43,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:24:43,633 INFO L93 Difference]: Finished difference Result 40 states and 40 transitions. [2022-11-16 11:24:43,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-11-16 11:24:43,634 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 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 32 [2022-11-16 11:24:43,635 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-16 11:24:43,635 INFO L225 Difference]: With dead ends: 40 [2022-11-16 11:24:43,635 INFO L226 Difference]: Without dead ends: 38 [2022-11-16 11:24:43,636 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 19 SyntacticMatches, 6 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 79.0s TimeCoverageRelationStatistics Valid=468, Invalid=1338, Unknown=0, NotChecked=0, Total=1806 [2022-11-16 11:24:43,637 INFO L413 NwaCegarLoop]: 4 mSDtfsCounter, 11 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 37 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-16 11:24:43,639 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 50 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 37 Unchecked, 0.0s Time] [2022-11-16 11:24:43,639 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-11-16 11:24:43,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-11-16 11:24:43,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 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:24:43,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 38 transitions. [2022-11-16 11:24:43,648 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 38 transitions. Word has length 32 [2022-11-16 11:24:43,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-16 11:24:43,649 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 38 transitions. [2022-11-16 11:24:43,649 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5897435897435896) internal successors, (62), 39 states have internal predecessors, (62), 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:24:43,649 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 38 transitions. [2022-11-16 11:24:43,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-11-16 11:24:43,650 INFO L187 NwaCegarLoop]: Found error trace [2022-11-16 11:24:43,650 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1] [2022-11-16 11:24:43,664 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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 (8)] Forceful destruction successful, exit code 0 [2022-11-16 11:24:43,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:24:43,860 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-11-16 11:24:43,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:24:43,861 INFO L85 PathProgramCache]: Analyzing trace with hash -1560106485, now seen corresponding path program 6 times [2022-11-16 11:24:43,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-11-16 11:24:43,861 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [742632667] [2022-11-16 11:24:43,862 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-11-16 11:24:43,862 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:24:43,862 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/mathsat [2022-11-16 11:24:43,863 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:24:43,869 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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 (9)] Waiting until timeout for monitored process [2022-11-16 11:24:43,990 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-11-16 11:24:43,990 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-11-16 11:24:43,990 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:24:44,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:24:44,151 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-11-16 11:24:44,151 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-16 11:24:44,152 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-11-16 11:24:44,175 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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 (9)] Forceful destruction successful, exit code 0 [2022-11-16 11:24:44,367 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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:24:44,370 INFO L444 BasicCegarLoop]: Path program histogram: [6, 1, 1] [2022-11-16 11:24:44,373 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-16 11:24:44,426 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,426 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,426 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,426 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,427 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,427 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,427 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,443 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.11 11:24:44 BoogieIcfgContainer [2022-11-16 11:24:44,443 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-16 11:24:44,448 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:24:44,448 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:24:44,449 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:24:44,449 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:20:32" (3/4) ... [2022-11-16 11:24:44,451 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-16 11:24:44,479 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,492 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,492 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,492 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,492 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,493 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,493 WARN L320 BoogieBacktranslator]: Removing null node from list of ATEs: ATE program state null [2022-11-16 11:24:44,581 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:24:44,581 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:24:44,581 INFO L158 Benchmark]: Toolchain (without parser) took 252896.20ms. Allocated memory was 52.4MB in the beginning and 645.9MB in the end (delta: 593.5MB). Free memory was 28.4MB in the beginning and 410.6MB in the end (delta: -382.2MB). Peak memory consumption was 210.3MB. Max. memory is 16.1GB. [2022-11-16 11:24:44,582 INFO L158 Benchmark]: CDTParser took 0.36ms. Allocated memory is still 52.4MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 39.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:24:44,582 INFO L158 Benchmark]: CACSL2BoogieTranslator took 382.08ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 28.2MB in the beginning and 51.6MB in the end (delta: -23.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. [2022-11-16 11:24:44,582 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.46ms. Allocated memory is still 69.2MB. Free memory was 51.6MB in the beginning and 50.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:24:44,583 INFO L158 Benchmark]: Boogie Preprocessor took 59.47ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 48.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:24:44,584 INFO L158 Benchmark]: RCFGBuilder took 355.21ms. Allocated memory is still 69.2MB. Free memory was 48.7MB in the beginning and 37.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:24:44,584 INFO L158 Benchmark]: TraceAbstraction took 251894.41ms. Allocated memory was 69.2MB in the beginning and 645.9MB in the end (delta: 576.7MB). Free memory was 51.5MB in the beginning and 419.0MB in the end (delta: -367.5MB). Peak memory consumption was 208.8MB. Max. memory is 16.1GB. [2022-11-16 11:24:44,585 INFO L158 Benchmark]: Witness Printer took 132.83ms. Allocated memory is still 645.9MB. Free memory was 419.0MB in the beginning and 410.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-11-16 11:24:44,587 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.36ms. Allocated memory is still 52.4MB. Free memory was 33.4MB in the beginning and 33.4MB in the end (delta: 39.6kB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 382.08ms. Allocated memory was 52.4MB in the beginning and 69.2MB in the end (delta: 16.8MB). Free memory was 28.2MB in the beginning and 51.6MB in the end (delta: -23.5MB). Peak memory consumption was 5.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.46ms. Allocated memory is still 69.2MB. Free memory was 51.6MB in the beginning and 50.0MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 59.47ms. Allocated memory is still 69.2MB. Free memory was 50.0MB in the beginning and 48.7MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 355.21ms. Allocated memory is still 69.2MB. Free memory was 48.7MB in the beginning and 37.1MB in the end (delta: 11.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 251894.41ms. Allocated memory was 69.2MB in the beginning and 645.9MB in the end (delta: 576.7MB). Free memory was 51.5MB in the beginning and 419.0MB in the end (delta: -367.5MB). Peak memory consumption was 208.8MB. Max. memory is 16.1GB. * Witness Printer took 132.83ms. Allocated memory is still 645.9MB. Free memory was 419.0MB in the beginning and 410.6MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. 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_5 = 0; [L33] const SORT_2 var_10 = 1; [L34] const SORT_2 var_17 = mask_SORT_2; [L36] SORT_1 input_3; [L37] SORT_1 input_4; [L39] SORT_2 state_6 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L40] SORT_2 state_7 = __VERIFIER_nondet_uchar() & mask_SORT_2; [L42] SORT_2 init_8_arg_1 = var_5; [L43] state_6 = init_8_arg_1 [L44] SORT_2 init_9_arg_1 = var_5; [L45] state_7 = init_9_arg_1 VAL [init_8_arg_1=0, init_9_arg_1=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, state_6=0, state_7=0, var_10=1, var_17=3, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=0, next_16_arg_1=1, state_6=0, state_7=1, var_10=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=1, var_13=0, var_13_arg_0=0, var_13_arg_1=1, var_13_arg_2=0, var_14=1, var_14_arg_0=1, var_14_arg_1=1, var_14_arg_2=0, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=1, next_16_arg_1=1, state_6=1, state_7=1, var_10=1, var_11=1, var_11_arg_0=0, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=1, var_13_arg_0=1, var_13_arg_1=1, var_13_arg_2=0, var_14=1, var_14_arg_0=0, var_14_arg_1=2, var_14_arg_2=1, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=2, next_16_arg_1=1, state_6=2, state_7=1, var_10=1, var_11=2, var_11_arg_0=1, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=2, var_13_arg_0=1, var_13_arg_1=2, var_13_arg_2=1, var_14=1, var_14_arg_0=0, var_14_arg_1=2, var_14_arg_2=1, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=2, next_16_arg_1=2, state_6=2, state_7=2, var_10=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=2, var_12_arg_0=1, var_12_arg_1=1, var_13=2, var_13_arg_0=0, var_13_arg_1=3, var_13_arg_2=2, var_14=2, var_14_arg_0=1, var_14_arg_1=2, var_14_arg_2=1, var_17=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=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=1, input_4=0, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=2, state_6=3, state_7=2, var_10=1, var_11=3, var_11_arg_0=2, var_11_arg_1=1, var_12=3, var_12_arg_0=2, var_12_arg_1=1, var_13=3, var_13_arg_0=1, var_13_arg_1=3, var_13_arg_2=2, var_14=2, var_14_arg_0=0, var_14_arg_1=3, var_14_arg_2=2, var_17=3, var_18=0, var_18_arg_0=2, var_18_arg_1=3, var_19=0, var_19_arg_0=2, var_19_arg_1=3, var_20=0, var_20_arg_0=0, var_20_arg_1=0, var_22=1, var_22_arg_0=1, var_22_arg_1=0, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_arg_0)) [L21] COND FALSE !(!(cond)) VAL [\old(cond)=1, cond=1] [L71] RET __VERIFIER_assert(!(bad_21_arg_0)) [L73] SORT_2 var_11_arg_0 = state_6; [L74] SORT_2 var_11_arg_1 = var_10; [L75] SORT_2 var_11 = var_11_arg_0 + var_11_arg_1; [L76] SORT_1 var_13_arg_0 = input_3; [L77] SORT_2 var_13_arg_1 = var_11; [L78] SORT_2 var_13_arg_2 = state_6; [L79] SORT_2 var_13 = var_13_arg_0 ? var_13_arg_1 : var_13_arg_2; [L80] var_13 = var_13 & mask_SORT_2 [L81] SORT_2 next_15_arg_1 = var_13; [L82] SORT_2 var_12_arg_0 = state_7; [L83] SORT_2 var_12_arg_1 = var_10; [L84] SORT_2 var_12 = var_12_arg_0 + var_12_arg_1; [L85] SORT_1 var_14_arg_0 = input_4; [L86] SORT_2 var_14_arg_1 = var_12; [L87] SORT_2 var_14_arg_2 = state_7; [L88] SORT_2 var_14 = var_14_arg_0 ? var_14_arg_1 : var_14_arg_2; [L89] var_14 = var_14 & mask_SORT_2 [L90] SORT_2 next_16_arg_1 = var_14; [L92] state_6 = next_15_arg_1 [L93] state_7 = next_16_arg_1 VAL [bad_21_arg_0=0, constr_23_arg_0=1, init_8_arg_1=0, init_9_arg_1=0, input_3=0, input_4=1, mask_SORT_1=1, mask_SORT_2=3, msb_SORT_1=1, msb_SORT_2=2, next_15_arg_1=3, next_16_arg_1=3, state_6=3, state_7=3, var_10=1, var_11=4, var_11_arg_0=3, var_11_arg_1=1, var_12=3, var_12_arg_0=2, var_12_arg_1=1, var_13=3, var_13_arg_0=0, var_13_arg_1=4, var_13_arg_2=3, var_14=3, var_14_arg_0=1, var_14_arg_1=3, var_14_arg_2=2, var_17=3, var_18=1, var_18_arg_0=3, var_18_arg_1=3, var_19=0, var_19_arg_0=2, var_19_arg_1=3, var_20=0, var_20_arg_0=1, var_20_arg_1=0, var_22=1, var_22_arg_0=0, var_22_arg_1=1, var_5=0] [L48] input_3 = __VERIFIER_nondet_uchar() [L49] input_3 = input_3 & mask_SORT_1 [L50] input_4 = __VERIFIER_nondet_uchar() [L51] input_4 = input_4 & mask_SORT_1 [L53] SORT_1 var_22_arg_0 = input_3; [L54] SORT_1 var_22_arg_1 = input_4; [L55] SORT_1 var_22 = ~(var_22_arg_0 & var_22_arg_1); [L56] var_22 = var_22 & mask_SORT_1 [L57] SORT_1 constr_23_arg_0 = var_22; [L58] CALL assume_abort_if_not(constr_23_arg_0) [L22] COND FALSE !(!cond) VAL [\old(cond)=1, cond=1] [L58] RET assume_abort_if_not(constr_23_arg_0) [L60] SORT_2 var_18_arg_0 = state_6; [L61] SORT_2 var_18_arg_1 = var_17; [L62] SORT_1 var_18 = var_18_arg_0 == var_18_arg_1; [L63] SORT_2 var_19_arg_0 = state_7; [L64] SORT_2 var_19_arg_1 = var_17; [L65] SORT_1 var_19 = var_19_arg_0 == var_19_arg_1; [L66] SORT_1 var_20_arg_0 = var_18; [L67] SORT_1 var_20_arg_1 = var_19; [L68] SORT_1 var_20 = var_20_arg_0 & var_20_arg_1; [L69] var_20 = var_20 & mask_SORT_1 [L70] SORT_1 bad_21_arg_0 = var_20; [L71] CALL __VERIFIER_assert(!(bad_21_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, 13 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 251.8s, OverallIterations: 8, TraceHistogramMax: 7, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 2.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 80 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 80 mSDsluCounter, 214 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 146 IncrementalHoareTripleChecker+Unchecked, 173 mSDsCounter, 8 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 67 IncrementalHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 8 mSolverCounterUnsat, 41 mSDtfsCounter, 67 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 123 SyntacticMatches, 6 SemanticMatches, 116 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1536 ImplicationChecksByTransitivity, 101.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=38occurred in iteration=7, InterpolantAutomatonStates: 83, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 7 MinimizatonAttempts, 12 StatesRemovedByMinimization, 3 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 246.1s InterpolantComputationTime, 161 NumberOfCodeBlocks, 161 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 222 ConstructedInterpolants, 127 QuantifiedInterpolants, 198774 SizeOfPredicates, 426 NumberOfNonLiveVariables, 859 ConjunctsInSsa, 445 ConjunctsInUnsatCore, 12 InterpolantComputations, 2 PerfectInterpolantSequences, 0/320 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:24:44,673 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_69108aa1-3040-4de7-88aa-0d36813e849c/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