./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/locks/test_locks_12.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination 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_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/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_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8 --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d --- 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:22:17,012 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-16 11:22:17,019 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-16 11:22:17,063 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-16 11:22:17,065 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-16 11:22:17,067 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-16 11:22:17,070 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-16 11:22:17,074 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-16 11:22:17,077 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-16 11:22:17,080 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-16 11:22:17,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-16 11:22:17,086 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-16 11:22:17,086 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-16 11:22:17,092 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-16 11:22:17,093 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-16 11:22:17,095 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-16 11:22:17,098 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-16 11:22:17,099 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-16 11:22:17,100 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-16 11:22:17,106 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-16 11:22:17,108 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-16 11:22:17,109 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-16 11:22:17,112 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-16 11:22:17,114 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-16 11:22:17,124 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-16 11:22:17,124 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-16 11:22:17,125 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-16 11:22:17,127 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-16 11:22:17,127 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-16 11:22:17,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-16 11:22:17,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-16 11:22:17,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-16 11:22:17,133 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-16 11:22:17,135 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-16 11:22:17,137 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-16 11:22:17,137 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-16 11:22:17,138 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-16 11:22:17,138 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-16 11:22:17,139 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-16 11:22:17,140 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-16 11:22:17,141 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-16 11:22:17,142 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-11-16 11:22:17,178 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-16 11:22:17,178 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-16 11:22:17,179 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-16 11:22:17,179 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-16 11:22:17,180 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-16 11:22:17,180 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-16 11:22:17,180 INFO L138 SettingsManager]: * Use SBE=true [2022-11-16 11:22:17,180 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-11-16 11:22:17,180 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-11-16 11:22:17,180 INFO L138 SettingsManager]: * Use old map elimination=false [2022-11-16 11:22:17,180 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-11-16 11:22:17,181 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-11-16 11:22:17,181 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-11-16 11:22:17,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-16 11:22:17,181 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-16 11:22:17,181 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-16 11:22:17,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-16 11:22:17,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-16 11:22:17,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-16 11:22:17,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-11-16 11:22:17,182 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-11-16 11:22:17,182 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-11-16 11:22:17,182 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-16 11:22:17,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-16 11:22:17,183 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-11-16 11:22:17,183 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-16 11:22:17,183 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-11-16 11:22:17,183 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-16 11:22:17,183 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-16 11:22:17,184 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-16 11:22:17,184 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-16 11:22:17,185 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-11-16 11:22:17,185 INFO L138 SettingsManager]: * TransformationType=MODULO_NEIGHBOR 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_e1908d86-4503-4103-884b-795620b019e6/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_e1908d86-4503-4103-884b-795620b019e6/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(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 12c3feea735c5360de013afbcf9aaa3880d39f75cbb7661493cccf003151044d [2022-11-16 11:22:17,559 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-16 11:22:17,588 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-16 11:22:17,591 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-16 11:22:17,592 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-16 11:22:17,593 INFO L275 PluginConnector]: CDTParser initialized [2022-11-16 11:22:17,594 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/../../sv-benchmarks/c/locks/test_locks_12.c [2022-11-16 11:22:17,680 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/data/b1af6c29b/a9eda5fa49624082bb84e3d60522fd69/FLAG0076c7036 [2022-11-16 11:22:18,178 INFO L306 CDTParser]: Found 1 translation units. [2022-11-16 11:22:18,179 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/sv-benchmarks/c/locks/test_locks_12.c [2022-11-16 11:22:18,192 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/data/b1af6c29b/a9eda5fa49624082bb84e3d60522fd69/FLAG0076c7036 [2022-11-16 11:22:18,540 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/data/b1af6c29b/a9eda5fa49624082bb84e3d60522fd69 [2022-11-16 11:22:18,543 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-16 11:22:18,545 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-16 11:22:18,547 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-16 11:22:18,547 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-16 11:22:18,551 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-16 11:22:18,551 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,553 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7b648f95 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18, skipping insertion in model container [2022-11-16 11:22:18,553 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,561 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-16 11:22:18,581 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-16 11:22:18,783 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_e1908d86-4503-4103-884b-795620b019e6/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-11-16 11:22:18,785 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:22:18,795 INFO L203 MainTranslator]: Completed pre-run [2022-11-16 11:22:18,822 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_e1908d86-4503-4103-884b-795620b019e6/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-11-16 11:22:18,823 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-16 11:22:18,837 INFO L208 MainTranslator]: Completed translation [2022-11-16 11:22:18,837 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18 WrapperNode [2022-11-16 11:22:18,837 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-16 11:22:18,839 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-16 11:22:18,839 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-16 11:22:18,839 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-16 11:22:18,847 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:22:18" (1/1) ... [2022-11-16 11:22:18,854 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:22:18" (1/1) ... [2022-11-16 11:22:18,875 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-11-16 11:22:18,876 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-16 11:22:18,877 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-16 11:22:18,877 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-16 11:22:18,877 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-16 11:22:18,887 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,887 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,889 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,889 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,894 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,900 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,901 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,903 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,905 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-16 11:22:18,906 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-16 11:22:18,906 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-16 11:22:18,906 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-16 11:22:18,907 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (1/1) ... [2022-11-16 11:22:18,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-11-16 11:22:18,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/z3 [2022-11-16 11:22:18,965 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-11-16 11:22:18,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-11-16 11:22:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-16 11:22:19,020 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-16 11:22:19,020 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-16 11:22:19,021 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-16 11:22:19,098 INFO L235 CfgBuilder]: Building ICFG [2022-11-16 11:22:19,100 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-16 11:22:19,352 INFO L276 CfgBuilder]: Performing block encoding [2022-11-16 11:22:19,359 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-16 11:22:19,359 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-11-16 11:22:19,361 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:22:19 BoogieIcfgContainer [2022-11-16 11:22:19,361 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-16 11:22:19,362 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-11-16 11:22:19,362 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-11-16 11:22:19,383 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-11-16 11:22:19,384 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:22:19,384 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 16.11 11:22:18" (1/3) ... [2022-11-16 11:22:19,385 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e5160c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:22:19, skipping insertion in model container [2022-11-16 11:22:19,385 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:22:19,385 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 11:22:18" (2/3) ... [2022-11-16 11:22:19,386 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2e5160c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 16.11 11:22:19, skipping insertion in model container [2022-11-16 11:22:19,386 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-11-16 11:22:19,386 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:22:19" (3/3) ... [2022-11-16 11:22:19,388 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2022-11-16 11:22:19,478 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-11-16 11:22:19,479 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-11-16 11:22:19,479 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-11-16 11:22:19,479 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-11-16 11:22:19,479 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-11-16 11:22:19,479 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-11-16 11:22:19,479 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-11-16 11:22:19,480 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-11-16 11:22:19,484 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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:22:19,520 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-11-16 11:22:19,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:19,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:19,527 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:19,528 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:19,528 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-11-16 11:22:19,529 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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:22:19,539 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-11-16 11:22:19,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:19,540 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:19,541 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:19,542 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:19,549 INFO L748 eck$LassoCheckResult]: Stem: 24#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 33#L183-1true [2022-11-16 11:22:19,552 INFO L750 eck$LassoCheckResult]: Loop: 33#L183-1true assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 17#L49true assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 34#L78true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 14#L78-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 12#L82-1true assume !(0 != main_~p3~0#1); 8#L86-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 35#L90-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 11#L94-1true assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 19#L98-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 32#L102-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 15#L106-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 25#L110-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 41#L114-1true assume !(0 != main_~p11~0#1); 30#L118-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13#L122-1true assume !(0 != main_~p1~0#1); 27#L128-1true assume !(0 != main_~p2~0#1); 4#L133-1true assume !(0 != main_~p3~0#1); 3#L138-1true assume !(0 != main_~p4~0#1); 26#L143-1true assume !(0 != main_~p5~0#1); 5#L148-1true assume !(0 != main_~p6~0#1); 21#L153-1true assume !(0 != main_~p7~0#1); 38#L158-1true assume !(0 != main_~p8~0#1); 23#L163-1true assume !(0 != main_~p9~0#1); 40#L168-1true assume !(0 != main_~p10~0#1); 18#L173-1true assume !(0 != main_~p11~0#1); 7#L178-1true assume !(0 != main_~p12~0#1); 33#L183-1true [2022-11-16 11:22:19,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:19,566 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-11-16 11:22:19,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:19,576 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882670111] [2022-11-16 11:22:19,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:19,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:19,694 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:19,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:19,744 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:19,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:19,748 INFO L85 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2022-11-16 11:22:19,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:19,751 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871998741] [2022-11-16 11:22:19,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:19,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:19,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:19,930 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:22:19,930 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:19,931 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871998741] [2022-11-16 11:22:19,932 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1871998741] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:19,932 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:19,932 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:19,933 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097792076] [2022-11-16 11:22:19,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:19,938 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:19,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:19,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:19,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:19,981 INFO L87 Difference]: Start difference. First operand has 45 states, 44 states have (on average 1.8863636363636365) internal successors, (83), 44 states have internal predecessors, (83), 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 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:20,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:20,048 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2022-11-16 11:22:20,052 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2022-11-16 11:22:20,055 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-11-16 11:22:20,067 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2022-11-16 11:22:20,069 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-11-16 11:22:20,069 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-11-16 11:22:20,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2022-11-16 11:22:20,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:20,071 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-11-16 11:22:20,088 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2022-11-16 11:22:20,106 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-11-16 11:22:20,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 77 states have (on average 1.5974025974025974) internal successors, (123), 76 states have internal predecessors, (123), 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:22:20,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2022-11-16 11:22:20,117 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-11-16 11:22:20,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:20,122 INFO L428 stractBuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-11-16 11:22:20,123 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-11-16 11:22:20,123 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2022-11-16 11:22:20,131 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-11-16 11:22:20,131 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:20,131 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:20,133 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:20,134 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:20,134 INFO L748 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 151#L183-1 [2022-11-16 11:22:20,134 INFO L750 eck$LassoCheckResult]: Loop: 151#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 167#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 168#L78 assume !(0 != main_~p1~0#1); 196#L78-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 195#L82-1 assume !(0 != main_~p3~0#1); 153#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 154#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 194#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 193#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 192#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 191#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 187#L114-1 assume !(0 != main_~p11~0#1); 188#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 189#L122-1 assume !(0 != main_~p1~0#1); 179#L128-1 assume !(0 != main_~p2~0#1); 144#L133-1 assume !(0 != main_~p3~0#1); 141#L138-1 assume !(0 != main_~p4~0#1); 142#L143-1 assume !(0 != main_~p5~0#1); 146#L148-1 assume !(0 != main_~p6~0#1); 148#L153-1 assume !(0 != main_~p7~0#1); 156#L158-1 assume !(0 != main_~p8~0#1); 205#L163-1 assume !(0 != main_~p9~0#1); 185#L168-1 assume !(0 != main_~p10~0#1); 169#L173-1 assume !(0 != main_~p11~0#1); 149#L178-1 assume !(0 != main_~p12~0#1); 151#L183-1 [2022-11-16 11:22:20,136 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,137 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-11-16 11:22:20,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,137 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355940008] [2022-11-16 11:22:20,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,151 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:20,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,165 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:20,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,166 INFO L85 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2022-11-16 11:22:20,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,167 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166498905] [2022-11-16 11:22:20,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:20,277 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:22:20,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:20,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166498905] [2022-11-16 11:22:20,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166498905] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:20,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:20,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:20,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326919612] [2022-11-16 11:22:20,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:20,279 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:20,279 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:20,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:20,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:20,280 INFO L87 Difference]: Start difference. First operand 77 states and 123 transitions. cyclomatic complexity: 48 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:20,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:20,301 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2022-11-16 11:22:20,301 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2022-11-16 11:22:20,303 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-11-16 11:22:20,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2022-11-16 11:22:20,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2022-11-16 11:22:20,305 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2022-11-16 11:22:20,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2022-11-16 11:22:20,306 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:20,306 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-11-16 11:22:20,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2022-11-16 11:22:20,315 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-11-16 11:22:20,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 150 states have (on average 1.5866666666666667) internal successors, (238), 149 states have internal predecessors, (238), 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:22:20,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2022-11-16 11:22:20,317 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-11-16 11:22:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:20,318 INFO L428 stractBuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-11-16 11:22:20,319 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-11-16 11:22:20,319 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2022-11-16 11:22:20,320 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-11-16 11:22:20,321 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:20,321 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:20,321 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:20,321 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:20,322 INFO L748 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 387#L183-1 [2022-11-16 11:22:20,325 INFO L750 eck$LassoCheckResult]: Loop: 387#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 405#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 406#L78 assume !(0 != main_~p1~0#1); 483#L78-2 assume !(0 != main_~p2~0#1); 396#L82-1 assume !(0 != main_~p3~0#1); 390#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 391#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 475#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 471#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 469#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 466#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 464#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 427#L114-1 assume !(0 != main_~p11~0#1); 419#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 420#L122-1 assume !(0 != main_~p1~0#1); 458#L128-1 assume !(0 != main_~p2~0#1); 377#L133-1 assume !(0 != main_~p3~0#1); 379#L138-1 assume !(0 != main_~p4~0#1); 448#L143-1 assume !(0 != main_~p5~0#1); 446#L148-1 assume !(0 != main_~p6~0#1); 444#L153-1 assume !(0 != main_~p7~0#1); 424#L158-1 assume !(0 != main_~p8~0#1); 409#L163-1 assume !(0 != main_~p9~0#1); 411#L168-1 assume !(0 != main_~p10~0#1); 439#L173-1 assume !(0 != main_~p11~0#1); 434#L178-1 assume !(0 != main_~p12~0#1); 387#L183-1 [2022-11-16 11:22:20,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,326 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-11-16 11:22:20,326 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,326 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648668380] [2022-11-16 11:22:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,333 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:20,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,343 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2022-11-16 11:22:20,347 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565448104] [2022-11-16 11:22:20,347 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,348 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:20,416 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:22:20,416 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:20,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565448104] [2022-11-16 11:22:20,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565448104] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:20,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:20,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:20,418 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392002902] [2022-11-16 11:22:20,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:20,418 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:20,419 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:20,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:20,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:20,420 INFO L87 Difference]: Start difference. First operand 150 states and 238 transitions. cyclomatic complexity: 92 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:20,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:20,465 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2022-11-16 11:22:20,465 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2022-11-16 11:22:20,469 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-11-16 11:22:20,471 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2022-11-16 11:22:20,471 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2022-11-16 11:22:20,472 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2022-11-16 11:22:20,472 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2022-11-16 11:22:20,474 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:20,474 INFO L218 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-11-16 11:22:20,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2022-11-16 11:22:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-11-16 11:22:20,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 294 states, 294 states have (on average 1.5714285714285714) internal successors, (462), 293 states have internal predecessors, (462), 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:22:20,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2022-11-16 11:22:20,519 INFO L240 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-11-16 11:22:20,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:20,527 INFO L428 stractBuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-11-16 11:22:20,527 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-11-16 11:22:20,527 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2022-11-16 11:22:20,532 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-11-16 11:22:20,532 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:20,532 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:20,533 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:20,533 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:20,534 INFO L748 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 832#L183-1 [2022-11-16 11:22:20,534 INFO L750 eck$LassoCheckResult]: Loop: 832#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 936#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 930#L78 assume !(0 != main_~p1~0#1); 931#L78-2 assume !(0 != main_~p2~0#1); 1011#L82-1 assume !(0 != main_~p3~0#1); 1007#L86-1 assume !(0 != main_~p4~0#1); 1004#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1001#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 998#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 995#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 992#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 989#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 986#L114-1 assume !(0 != main_~p11~0#1); 981#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 932#L122-1 assume !(0 != main_~p1~0#1); 933#L128-1 assume !(0 != main_~p2~0#1); 977#L133-1 assume !(0 != main_~p3~0#1); 972#L138-1 assume !(0 != main_~p4~0#1); 969#L143-1 assume !(0 != main_~p5~0#1); 965#L148-1 assume !(0 != main_~p6~0#1); 961#L153-1 assume !(0 != main_~p7~0#1); 957#L158-1 assume !(0 != main_~p8~0#1); 953#L163-1 assume !(0 != main_~p9~0#1); 949#L168-1 assume !(0 != main_~p10~0#1); 944#L173-1 assume !(0 != main_~p11~0#1); 941#L178-1 assume !(0 != main_~p12~0#1); 832#L183-1 [2022-11-16 11:22:20,534 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-11-16 11:22:20,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,535 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120853507] [2022-11-16 11:22:20,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:20,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,547 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:20,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,548 INFO L85 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2022-11-16 11:22:20,548 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671671812] [2022-11-16 11:22:20,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:20,606 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:22:20,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:20,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671671812] [2022-11-16 11:22:20,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671671812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:20,610 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:20,610 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:20,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [67951465] [2022-11-16 11:22:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:20,611 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:20,612 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:20,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:20,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:20,617 INFO L87 Difference]: Start difference. First operand 294 states and 462 transitions. cyclomatic complexity: 176 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:20,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:20,668 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2022-11-16 11:22:20,668 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2022-11-16 11:22:20,673 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-11-16 11:22:20,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2022-11-16 11:22:20,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-11-16 11:22:20,680 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-11-16 11:22:20,681 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2022-11-16 11:22:20,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:20,692 INFO L218 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-11-16 11:22:20,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2022-11-16 11:22:20,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-11-16 11:22:20,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 578 states, 578 states have (on average 1.5536332179930796) internal successors, (898), 577 states have internal predecessors, (898), 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:22:20,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2022-11-16 11:22:20,744 INFO L240 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-11-16 11:22:20,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:20,746 INFO L428 stractBuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-11-16 11:22:20,746 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-11-16 11:22:20,746 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2022-11-16 11:22:20,750 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-11-16 11:22:20,750 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:20,750 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:20,751 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:20,751 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:20,751 INFO L748 eck$LassoCheckResult]: Stem: 1741#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 1710#L183-1 [2022-11-16 11:22:20,751 INFO L750 eck$LassoCheckResult]: Loop: 1710#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1939#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 1938#L78 assume !(0 != main_~p1~0#1); 1937#L78-2 assume !(0 != main_~p2~0#1); 1928#L82-1 assume !(0 != main_~p3~0#1); 1929#L86-1 assume !(0 != main_~p4~0#1); 1910#L90-1 assume !(0 != main_~p5~0#1); 1912#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1894#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1895#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1878#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1879#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1862#L114-1 assume !(0 != main_~p11~0#1); 1863#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1846#L122-1 assume !(0 != main_~p1~0#1); 1847#L128-1 assume !(0 != main_~p2~0#1); 1967#L133-1 assume !(0 != main_~p3~0#1); 1964#L138-1 assume !(0 != main_~p4~0#1); 1961#L143-1 assume !(0 != main_~p5~0#1); 1960#L148-1 assume !(0 != main_~p6~0#1); 1958#L153-1 assume !(0 != main_~p7~0#1); 1956#L158-1 assume !(0 != main_~p8~0#1); 1953#L163-1 assume !(0 != main_~p9~0#1); 1951#L168-1 assume !(0 != main_~p10~0#1); 1945#L173-1 assume !(0 != main_~p11~0#1); 1942#L178-1 assume !(0 != main_~p12~0#1); 1710#L183-1 [2022-11-16 11:22:20,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,752 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-11-16 11:22:20,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583574342] [2022-11-16 11:22:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,758 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:20,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,763 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:20,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2022-11-16 11:22:20,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,764 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777744526] [2022-11-16 11:22:20,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:20,816 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:22:20,816 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:20,817 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777744526] [2022-11-16 11:22:20,817 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777744526] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:20,817 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:20,817 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:20,817 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610259035] [2022-11-16 11:22:20,817 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:20,818 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:20,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:20,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:20,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:20,822 INFO L87 Difference]: Start difference. First operand 578 states and 898 transitions. cyclomatic complexity: 336 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:20,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:20,841 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2022-11-16 11:22:20,841 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2022-11-16 11:22:20,851 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-11-16 11:22:20,858 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-11-16 11:22:20,859 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2022-11-16 11:22:20,861 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2022-11-16 11:22:20,861 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2022-11-16 11:22:20,865 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:20,865 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-11-16 11:22:20,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2022-11-16 11:22:20,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2022-11-16 11:22:20,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1138 states, 1138 states have (on average 1.5342706502636203) internal successors, (1746), 1137 states have internal predecessors, (1746), 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:22:20,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-11-16 11:22:20,907 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-11-16 11:22:20,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:20,910 INFO L428 stractBuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-11-16 11:22:20,910 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-11-16 11:22:20,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2022-11-16 11:22:20,918 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-11-16 11:22:20,918 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:20,918 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:20,920 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:20,920 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:20,920 INFO L748 eck$LassoCheckResult]: Stem: 3463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3431#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 3432#L183-1 [2022-11-16 11:22:20,921 INFO L750 eck$LassoCheckResult]: Loop: 3432#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3657#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 3654#L78 assume !(0 != main_~p1~0#1); 3651#L78-2 assume !(0 != main_~p2~0#1); 3644#L82-1 assume !(0 != main_~p3~0#1); 3645#L86-1 assume !(0 != main_~p4~0#1); 3627#L90-1 assume !(0 != main_~p5~0#1); 3629#L94-1 assume !(0 != main_~p6~0#1); 3613#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3614#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3599#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3600#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3585#L114-1 assume !(0 != main_~p11~0#1); 3586#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3567#L122-1 assume !(0 != main_~p1~0#1); 3568#L128-1 assume !(0 != main_~p2~0#1); 3691#L133-1 assume !(0 != main_~p3~0#1); 3688#L138-1 assume !(0 != main_~p4~0#1); 3686#L143-1 assume !(0 != main_~p5~0#1); 3684#L148-1 assume !(0 != main_~p6~0#1); 3681#L153-1 assume !(0 != main_~p7~0#1); 3677#L158-1 assume !(0 != main_~p8~0#1); 3673#L163-1 assume !(0 != main_~p9~0#1); 3669#L168-1 assume !(0 != main_~p10~0#1); 3664#L173-1 assume !(0 != main_~p11~0#1); 3661#L178-1 assume !(0 != main_~p12~0#1); 3432#L183-1 [2022-11-16 11:22:20,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,922 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-11-16 11:22:20,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,922 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1465622950] [2022-11-16 11:22:20,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,932 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:20,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:20,954 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:20,956 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:20,957 INFO L85 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2022-11-16 11:22:20,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:20,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [49692812] [2022-11-16 11:22:20,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:20,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:20,998 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:22:20,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:20,999 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [49692812] [2022-11-16 11:22:20,999 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [49692812] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:20,999 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:20,999 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:20,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1904612479] [2022-11-16 11:22:21,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:21,000 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:21,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:21,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:21,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:21,001 INFO L87 Difference]: Start difference. First operand 1138 states and 1746 transitions. cyclomatic complexity: 640 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:21,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:21,025 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2022-11-16 11:22:21,026 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2022-11-16 11:22:21,077 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-11-16 11:22:21,092 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-11-16 11:22:21,094 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2022-11-16 11:22:21,096 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2022-11-16 11:22:21,096 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2022-11-16 11:22:21,101 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:21,101 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-11-16 11:22:21,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2022-11-16 11:22:21,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2022-11-16 11:22:21,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2242 states, 2242 states have (on average 1.5138269402319358) internal successors, (3394), 2241 states have internal predecessors, (3394), 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:22:21,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-11-16 11:22:21,180 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-11-16 11:22:21,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:21,185 INFO L428 stractBuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-11-16 11:22:21,188 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-11-16 11:22:21,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2022-11-16 11:22:21,202 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-11-16 11:22:21,202 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:21,203 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:21,204 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:21,206 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:21,206 INFO L748 eck$LassoCheckResult]: Stem: 6848#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6817#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 6818#L183-1 [2022-11-16 11:22:21,206 INFO L750 eck$LassoCheckResult]: Loop: 6818#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 7040#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 7037#L78 assume !(0 != main_~p1~0#1); 7034#L78-2 assume !(0 != main_~p2~0#1); 7026#L82-1 assume !(0 != main_~p3~0#1); 7027#L86-1 assume !(0 != main_~p4~0#1); 7010#L90-1 assume !(0 != main_~p5~0#1); 7011#L94-1 assume !(0 != main_~p6~0#1); 6994#L98-1 assume !(0 != main_~p7~0#1); 6996#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6982#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6983#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6970#L114-1 assume !(0 != main_~p11~0#1); 6971#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6953#L122-1 assume !(0 != main_~p1~0#1); 6954#L128-1 assume !(0 != main_~p2~0#1); 7073#L133-1 assume !(0 != main_~p3~0#1); 7070#L138-1 assume !(0 != main_~p4~0#1); 7068#L143-1 assume !(0 != main_~p5~0#1); 7066#L148-1 assume !(0 != main_~p6~0#1); 7064#L153-1 assume !(0 != main_~p7~0#1); 7061#L158-1 assume !(0 != main_~p8~0#1); 7057#L163-1 assume !(0 != main_~p9~0#1); 7053#L168-1 assume !(0 != main_~p10~0#1); 7048#L173-1 assume !(0 != main_~p11~0#1); 7045#L178-1 assume !(0 != main_~p12~0#1); 6818#L183-1 [2022-11-16 11:22:21,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:21,212 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-11-16 11:22:21,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:21,213 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1869716358] [2022-11-16 11:22:21,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:21,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:21,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:21,221 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:21,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:21,236 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:21,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:21,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2022-11-16 11:22:21,237 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:21,237 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802149647] [2022-11-16 11:22:21,237 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:21,237 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:21,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:21,270 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:22:21,270 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:21,270 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802149647] [2022-11-16 11:22:21,270 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802149647] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:21,271 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:21,271 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:21,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068210550] [2022-11-16 11:22:21,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:21,271 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:21,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:21,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:21,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:21,272 INFO L87 Difference]: Start difference. First operand 2242 states and 3394 transitions. cyclomatic complexity: 1216 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:21,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:21,305 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2022-11-16 11:22:21,305 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2022-11-16 11:22:21,338 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-11-16 11:22:21,360 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-11-16 11:22:21,360 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2022-11-16 11:22:21,364 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2022-11-16 11:22:21,364 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2022-11-16 11:22:21,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:21,370 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-11-16 11:22:21,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2022-11-16 11:22:21,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2022-11-16 11:22:21,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4418 states, 4418 states have (on average 1.4925305568130376) internal successors, (6594), 4417 states have internal predecessors, (6594), 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:22:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-11-16 11:22:21,497 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-11-16 11:22:21,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:21,498 INFO L428 stractBuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-11-16 11:22:21,498 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-11-16 11:22:21,498 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2022-11-16 11:22:21,522 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-11-16 11:22:21,522 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:21,522 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:21,523 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:21,523 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:21,523 INFO L748 eck$LassoCheckResult]: Stem: 13515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 13482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 13483#L183-1 [2022-11-16 11:22:21,523 INFO L750 eck$LassoCheckResult]: Loop: 13483#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 13834#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 13830#L78 assume !(0 != main_~p1~0#1); 13827#L78-2 assume !(0 != main_~p2~0#1); 13712#L82-1 assume !(0 != main_~p3~0#1); 13713#L86-1 assume !(0 != main_~p4~0#1); 13693#L90-1 assume !(0 != main_~p5~0#1); 13694#L94-1 assume !(0 != main_~p6~0#1); 13674#L98-1 assume !(0 != main_~p7~0#1); 13676#L102-1 assume !(0 != main_~p8~0#1); 13653#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 13654#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 13637#L114-1 assume !(0 != main_~p11~0#1); 13638#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13618#L122-1 assume !(0 != main_~p1~0#1); 13619#L128-1 assume !(0 != main_~p2~0#1); 13867#L133-1 assume !(0 != main_~p3~0#1); 13862#L138-1 assume !(0 != main_~p4~0#1); 13858#L143-1 assume !(0 != main_~p5~0#1); 13824#L148-1 assume !(0 != main_~p6~0#1); 13826#L153-1 assume !(0 != main_~p7~0#1); 13853#L158-1 assume !(0 != main_~p8~0#1); 13850#L163-1 assume !(0 != main_~p9~0#1); 13846#L168-1 assume !(0 != main_~p10~0#1); 13841#L173-1 assume !(0 != main_~p11~0#1); 13838#L178-1 assume !(0 != main_~p12~0#1); 13483#L183-1 [2022-11-16 11:22:21,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:21,524 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-11-16 11:22:21,524 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:21,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [842380151] [2022-11-16 11:22:21,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:21,525 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:21,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:21,541 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:21,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:21,548 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:21,549 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:21,549 INFO L85 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2022-11-16 11:22:21,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:21,550 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867194591] [2022-11-16 11:22:21,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:21,550 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:21,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:21,620 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:22:21,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:21,621 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867194591] [2022-11-16 11:22:21,621 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867194591] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:21,621 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:21,621 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:21,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1671978574] [2022-11-16 11:22:21,622 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:21,622 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:21,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:21,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:21,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:21,623 INFO L87 Difference]: Start difference. First operand 4418 states and 6594 transitions. cyclomatic complexity: 2304 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:21,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:21,685 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2022-11-16 11:22:21,685 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2022-11-16 11:22:21,741 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-11-16 11:22:21,857 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-11-16 11:22:21,861 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2022-11-16 11:22:21,866 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2022-11-16 11:22:21,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2022-11-16 11:22:21,879 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:21,879 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-11-16 11:22:21,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2022-11-16 11:22:22,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2022-11-16 11:22:22,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8706 states, 8706 states have (on average 1.4704801286469102) internal successors, (12802), 8705 states have internal predecessors, (12802), 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:22:22,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-11-16 11:22:22,108 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-11-16 11:22:22,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:22,111 INFO L428 stractBuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-11-16 11:22:22,112 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-11-16 11:22:22,112 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2022-11-16 11:22:22,149 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-11-16 11:22:22,149 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:22,149 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:22,153 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:22,153 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:22,153 INFO L748 eck$LassoCheckResult]: Stem: 26646#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 26612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 26613#L183-1 [2022-11-16 11:22:22,154 INFO L750 eck$LassoCheckResult]: Loop: 26613#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 27025#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 27021#L78 assume !(0 != main_~p1~0#1); 27018#L78-2 assume !(0 != main_~p2~0#1); 27019#L82-1 assume !(0 != main_~p3~0#1); 27063#L86-1 assume !(0 != main_~p4~0#1); 26838#L90-1 assume !(0 != main_~p5~0#1); 26839#L94-1 assume !(0 != main_~p6~0#1); 26819#L98-1 assume !(0 != main_~p7~0#1); 26821#L102-1 assume !(0 != main_~p8~0#1); 26795#L106-1 assume !(0 != main_~p9~0#1); 26797#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26778#L114-1 assume !(0 != main_~p11~0#1); 26779#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26759#L122-1 assume !(0 != main_~p1~0#1); 26760#L128-1 assume !(0 != main_~p2~0#1); 27053#L133-1 assume !(0 != main_~p3~0#1); 26987#L138-1 assume !(0 != main_~p4~0#1); 26988#L143-1 assume !(0 != main_~p5~0#1); 27049#L148-1 assume !(0 != main_~p6~0#1); 27047#L153-1 assume !(0 != main_~p7~0#1); 27044#L158-1 assume !(0 != main_~p8~0#1); 27040#L163-1 assume !(0 != main_~p9~0#1); 27037#L168-1 assume !(0 != main_~p10~0#1); 27032#L173-1 assume !(0 != main_~p11~0#1); 27029#L178-1 assume !(0 != main_~p12~0#1); 26613#L183-1 [2022-11-16 11:22:22,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:22,155 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-11-16 11:22:22,155 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:22,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697825139] [2022-11-16 11:22:22,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:22,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:22,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:22,175 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:22,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:22,184 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:22,187 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:22,187 INFO L85 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2022-11-16 11:22:22,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:22,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [289989445] [2022-11-16 11:22:22,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:22,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:22,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:22,222 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:22:22,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:22,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [289989445] [2022-11-16 11:22:22,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [289989445] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:22,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:22,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-16 11:22:22,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841338432] [2022-11-16 11:22:22,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:22,224 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:22,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:22,225 INFO L87 Difference]: Start difference. First operand 8706 states and 12802 transitions. cyclomatic complexity: 4352 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:22,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:22,386 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2022-11-16 11:22:22,386 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2022-11-16 11:22:22,461 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-11-16 11:22:22,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-11-16 11:22:22,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2022-11-16 11:22:22,527 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2022-11-16 11:22:22,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2022-11-16 11:22:22,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:22,615 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-11-16 11:22:22,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2022-11-16 11:22:23,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2022-11-16 11:22:23,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17154 states, 17154 states have (on average 1.4477089891570478) internal successors, (24834), 17153 states have internal predecessors, (24834), 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:22:23,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-11-16 11:22:23,258 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-11-16 11:22:23,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:23,260 INFO L428 stractBuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-11-16 11:22:23,260 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-11-16 11:22:23,261 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2022-11-16 11:22:23,332 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-11-16 11:22:23,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:23,332 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:23,333 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:23,333 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:23,333 INFO L748 eck$LassoCheckResult]: Stem: 52512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 52479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 52480#L183-1 [2022-11-16 11:22:23,335 INFO L750 eck$LassoCheckResult]: Loop: 52480#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 53075#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 53070#L78 assume !(0 != main_~p1~0#1); 53071#L78-2 assume !(0 != main_~p2~0#1); 53058#L82-1 assume !(0 != main_~p3~0#1); 53059#L86-1 assume !(0 != main_~p4~0#1); 53047#L90-1 assume !(0 != main_~p5~0#1); 53049#L94-1 assume !(0 != main_~p6~0#1); 53158#L98-1 assume !(0 != main_~p7~0#1); 53150#L102-1 assume !(0 != main_~p8~0#1); 53145#L106-1 assume !(0 != main_~p9~0#1); 53142#L110-1 assume !(0 != main_~p10~0#1); 53137#L114-1 assume !(0 != main_~p11~0#1); 53132#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 53127#L122-1 assume !(0 != main_~p1~0#1); 53121#L128-1 assume !(0 != main_~p2~0#1); 53120#L133-1 assume !(0 != main_~p3~0#1); 53116#L138-1 assume !(0 != main_~p4~0#1); 53113#L143-1 assume !(0 != main_~p5~0#1); 53109#L148-1 assume !(0 != main_~p6~0#1); 53105#L153-1 assume !(0 != main_~p7~0#1); 53101#L158-1 assume !(0 != main_~p8~0#1); 53097#L163-1 assume !(0 != main_~p9~0#1); 53089#L168-1 assume !(0 != main_~p10~0#1); 53087#L173-1 assume !(0 != main_~p11~0#1); 53086#L178-1 assume !(0 != main_~p12~0#1); 52480#L183-1 [2022-11-16 11:22:23,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-11-16 11:22:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:23,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362275790] [2022-11-16 11:22:23,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:23,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:23,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:23,346 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:23,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:23,357 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:23,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:23,359 INFO L85 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2022-11-16 11:22:23,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:23,359 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2126120652] [2022-11-16 11:22:23,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:23,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:23,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-16 11:22:23,402 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:22:23,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-16 11:22:23,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2126120652] [2022-11-16 11:22:23,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2126120652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-16 11:22:23,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-16 11:22:23,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-16 11:22:23,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [703544495] [2022-11-16 11:22:23,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-16 11:22:23,403 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-11-16 11:22:23,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-16 11:22:23,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-16 11:22:23,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-16 11:22:23,404 INFO L87 Difference]: Start difference. First operand 17154 states and 24834 transitions. cyclomatic complexity: 8192 Second operand has 3 states, 2 states have (on average 13.0) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-16 11:22:23,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-16 11:22:23,617 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2022-11-16 11:22:23,617 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2022-11-16 11:22:23,763 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2022-11-16 11:22:23,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2022-11-16 11:22:23,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2022-11-16 11:22:23,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2022-11-16 11:22:23,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2022-11-16 11:22:24,028 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-16 11:22:24,029 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-11-16 11:22:24,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2022-11-16 11:22:24,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2022-11-16 11:22:24,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33794 states, 33794 states have (on average 1.4242173166834349) internal successors, (48130), 33793 states have internal predecessors, (48130), 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:22:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2022-11-16 11:22:24,821 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-11-16 11:22:24,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-16 11:22:24,824 INFO L428 stractBuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-11-16 11:22:24,824 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-11-16 11:22:24,824 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2022-11-16 11:22:25,086 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2022-11-16 11:22:25,086 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-11-16 11:22:25,086 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-11-16 11:22:25,087 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-11-16 11:22:25,087 INFO L149 hiAutomatonCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 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:22:25,087 INFO L748 eck$LassoCheckResult]: Stem: 103466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 103432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 103433#L183-1 [2022-11-16 11:22:25,087 INFO L750 eck$LassoCheckResult]: Loop: 103433#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 103596#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 103594#L78 assume !(0 != main_~p1~0#1); 103590#L78-2 assume !(0 != main_~p2~0#1); 103588#L82-1 assume !(0 != main_~p3~0#1); 103584#L86-1 assume !(0 != main_~p4~0#1); 103580#L90-1 assume !(0 != main_~p5~0#1); 103576#L94-1 assume !(0 != main_~p6~0#1); 103572#L98-1 assume !(0 != main_~p7~0#1); 103568#L102-1 assume !(0 != main_~p8~0#1); 103564#L106-1 assume !(0 != main_~p9~0#1); 103560#L110-1 assume !(0 != main_~p10~0#1); 103558#L114-1 assume !(0 != main_~p11~0#1); 103554#L118-1 assume !(0 != main_~p12~0#1); 103551#L122-1 assume !(0 != main_~p1~0#1); 103552#L128-1 assume !(0 != main_~p2~0#1); 103636#L133-1 assume !(0 != main_~p3~0#1); 103631#L138-1 assume !(0 != main_~p4~0#1); 103627#L143-1 assume !(0 != main_~p5~0#1); 103623#L148-1 assume !(0 != main_~p6~0#1); 103619#L153-1 assume !(0 != main_~p7~0#1); 103615#L158-1 assume !(0 != main_~p8~0#1); 103611#L163-1 assume !(0 != main_~p9~0#1); 103607#L168-1 assume !(0 != main_~p10~0#1); 103603#L173-1 assume !(0 != main_~p11~0#1); 103599#L178-1 assume !(0 != main_~p12~0#1); 103433#L183-1 [2022-11-16 11:22:25,088 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:25,088 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-11-16 11:22:25,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:25,088 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700512451] [2022-11-16 11:22:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:25,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:25,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,100 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:25,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,108 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:25,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:25,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2022-11-16 11:22:25,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:25,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [228220025] [2022-11-16 11:22:25,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:25,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:25,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,114 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:25,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,123 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:25,124 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-16 11:22:25,124 INFO L85 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2022-11-16 11:22:25,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-16 11:22:25,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066525221] [2022-11-16 11:22:25,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-16 11:22:25,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-16 11:22:25,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,136 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:25,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,145 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-11-16 11:22:25,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,874 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-16 11:22:25,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-16 11:22:25,912 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 16.11 11:22:25 BoogieIcfgContainer [2022-11-16 11:22:25,912 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-11-16 11:22:25,912 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-16 11:22:25,913 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-16 11:22:25,913 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-16 11:22:25,913 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 16.11 11:22:19" (3/4) ... [2022-11-16 11:22:25,916 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-11-16 11:22:25,964 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/witness.graphml [2022-11-16 11:22:25,974 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-16 11:22:25,974 INFO L158 Benchmark]: Toolchain (without parser) took 7429.54ms. Allocated memory was 115.3MB in the beginning and 893.4MB in the end (delta: 778.0MB). Free memory was 73.3MB in the beginning and 656.7MB in the end (delta: -583.4MB). Peak memory consumption was 195.0MB. Max. memory is 16.1GB. [2022-11-16 11:22:25,975 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 115.3MB. Free memory was 90.1MB in the beginning and 90.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:22:25,976 INFO L158 Benchmark]: CACSL2BoogieTranslator took 291.20ms. Allocated memory is still 115.3MB. Free memory was 73.0MB in the beginning and 88.7MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-11-16 11:22:25,977 INFO L158 Benchmark]: Boogie Procedure Inliner took 37.54ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 87.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:22:25,977 INFO L158 Benchmark]: Boogie Preprocessor took 28.66ms. Allocated memory is still 115.3MB. Free memory was 87.1MB in the beginning and 85.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-16 11:22:25,977 INFO L158 Benchmark]: RCFGBuilder took 455.45ms. Allocated memory is still 115.3MB. Free memory was 85.7MB in the beginning and 72.4MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-11-16 11:22:25,978 INFO L158 Benchmark]: BuchiAutomizer took 6549.76ms. Allocated memory was 115.3MB in the beginning and 893.4MB in the end (delta: 778.0MB). Free memory was 71.9MB in the beginning and 658.8MB in the end (delta: -586.9MB). Peak memory consumption was 193.1MB. Max. memory is 16.1GB. [2022-11-16 11:22:25,978 INFO L158 Benchmark]: Witness Printer took 61.32ms. Allocated memory is still 893.4MB. Free memory was 658.8MB in the beginning and 656.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-16 11:22:25,980 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 115.3MB. Free memory was 90.1MB in the beginning and 90.0MB in the end (delta: 117.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 291.20ms. Allocated memory is still 115.3MB. Free memory was 73.0MB in the beginning and 88.7MB in the end (delta: -15.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 37.54ms. Allocated memory is still 115.3MB. Free memory was 88.7MB in the beginning and 87.1MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.66ms. Allocated memory is still 115.3MB. Free memory was 87.1MB in the beginning and 85.7MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 455.45ms. Allocated memory is still 115.3MB. Free memory was 85.7MB in the beginning and 72.4MB in the end (delta: 13.3MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * BuchiAutomizer took 6549.76ms. Allocated memory was 115.3MB in the beginning and 893.4MB in the end (delta: 778.0MB). Free memory was 71.9MB in the beginning and 658.8MB in the end (delta: -586.9MB). Peak memory consumption was 193.1MB. Max. memory is 16.1GB. * Witness Printer took 61.32ms. Allocated memory is still 893.4MB. Free memory was 658.8MB in the beginning and 656.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (10 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.10 modules have a trivial ranking function, the largest among these consists of 3 locations. The remainder module has 33794 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.4s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 1.9s. Construction of modules took 0.1s. Büchi inclusion checks took 3.7s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 2.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.8s Buchi closure took 0.0s. Biggest automaton had -1 states and ocurred in iteration -1. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 496 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 496 mSDsluCounter, 1552 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 595 mSDsCounter, 20 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 50 IncrementalHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 20 mSolverCounterUnsat, 957 mSDtfsCounter, 50 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI10 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s InitialAbstractionConstructionTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - LassoShapedNonTerminationArgument [Line: 47]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite program execution. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 47]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L8] int p1 = __VERIFIER_nondet_int(); [L9] int lk1; [L11] int p2 = __VERIFIER_nondet_int(); [L12] int lk2; [L14] int p3 = __VERIFIER_nondet_int(); [L15] int lk3; [L17] int p4 = __VERIFIER_nondet_int(); [L18] int lk4; [L20] int p5 = __VERIFIER_nondet_int(); [L21] int lk5; [L23] int p6 = __VERIFIER_nondet_int(); [L24] int lk6; [L26] int p7 = __VERIFIER_nondet_int(); [L27] int lk7; [L29] int p8 = __VERIFIER_nondet_int(); [L30] int lk8; [L32] int p9 = __VERIFIER_nondet_int(); [L33] int lk9; [L35] int p10 = __VERIFIER_nondet_int(); [L36] int lk10; [L38] int p11 = __VERIFIER_nondet_int(); [L39] int lk11; [L41] int p12 = __VERIFIER_nondet_int(); [L42] int lk12; [L45] int cond; Loop: [L47] COND TRUE 1 [L48] cond = __VERIFIER_nondet_int() [L49] COND FALSE !(cond == 0) [L52] lk1 = 0 [L54] lk2 = 0 [L56] lk3 = 0 [L58] lk4 = 0 [L60] lk5 = 0 [L62] lk6 = 0 [L64] lk7 = 0 [L66] lk8 = 0 [L68] lk9 = 0 [L70] lk10 = 0 [L72] lk11 = 0 [L74] lk12 = 0 [L78] COND FALSE !(p1 != 0) [L82] COND FALSE !(p2 != 0) [L86] COND FALSE !(p3 != 0) [L90] COND FALSE !(p4 != 0) [L94] COND FALSE !(p5 != 0) [L98] COND FALSE !(p6 != 0) [L102] COND FALSE !(p7 != 0) [L106] COND FALSE !(p8 != 0) [L110] COND FALSE !(p9 != 0) [L114] COND FALSE !(p10 != 0) [L118] COND FALSE !(p11 != 0) [L122] COND FALSE !(p12 != 0) [L128] COND FALSE !(p1 != 0) [L133] COND FALSE !(p2 != 0) [L138] COND FALSE !(p3 != 0) [L143] COND FALSE !(p4 != 0) [L148] COND FALSE !(p5 != 0) [L153] COND FALSE !(p6 != 0) [L158] COND FALSE !(p7 != 0) [L163] COND FALSE !(p8 != 0) [L168] COND FALSE !(p9 != 0) [L173] COND FALSE !(p10 != 0) [L178] COND FALSE !(p11 != 0) [L183] COND FALSE !(p12 != 0) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-11-16 11:22:26,018 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1908d86-4503-4103-884b-795620b019e6/bin/uautomizer-tPACEb0tL8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (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(TERM)