./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 2329fc70 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/locks/test_locks_12.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8 --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-2329fc7 [2022-12-13 19:47:05,005 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-12-13 19:47:05,007 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-12-13 19:47:05,020 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-12-13 19:47:05,021 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-12-13 19:47:05,021 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-12-13 19:47:05,022 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-12-13 19:47:05,023 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-12-13 19:47:05,024 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-12-13 19:47:05,025 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-12-13 19:47:05,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-12-13 19:47:05,026 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-12-13 19:47:05,026 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-12-13 19:47:05,027 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-12-13 19:47:05,028 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-12-13 19:47:05,028 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-12-13 19:47:05,029 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-12-13 19:47:05,029 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-12-13 19:47:05,030 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-12-13 19:47:05,031 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-12-13 19:47:05,032 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-12-13 19:47:05,033 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-12-13 19:47:05,034 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-12-13 19:47:05,034 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-12-13 19:47:05,036 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-12-13 19:47:05,036 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-12-13 19:47:05,036 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-12-13 19:47:05,037 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-12-13 19:47:05,037 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-12-13 19:47:05,038 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-12-13 19:47:05,038 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-12-13 19:47:05,038 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-12-13 19:47:05,039 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-12-13 19:47:05,039 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-12-13 19:47:05,040 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-12-13 19:47:05,040 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-12-13 19:47:05,040 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-12-13 19:47:05,041 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-12-13 19:47:05,041 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-12-13 19:47:05,041 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-12-13 19:47:05,042 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-12-13 19:47:05,042 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-12-13 19:47:05,063 INFO L113 SettingsManager]: Loading preferences was successful [2022-12-13 19:47:05,063 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-12-13 19:47:05,063 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-12-13 19:47:05,063 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-12-13 19:47:05,064 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-12-13 19:47:05,064 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-12-13 19:47:05,064 INFO L138 SettingsManager]: * Use SBE=true [2022-12-13 19:47:05,064 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-12-13 19:47:05,064 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-12-13 19:47:05,064 INFO L138 SettingsManager]: * Use old map elimination=false [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-12-13 19:47:05,065 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * sizeof long=4 [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-12-13 19:47:05,065 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * sizeof long double=12 [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * Use constant arrays=true [2022-12-13 19:47:05,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-12-13 19:47:05,067 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-12-13 19:47:05,067 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-12-13 19:47:05,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-12-13 19:47:05,067 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-12-13 19:47:05,068 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-12-13 19:47:05,068 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_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8 Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(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-12-13 19:47:05,233 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-12-13 19:47:05,253 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-12-13 19:47:05,255 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-12-13 19:47:05,255 INFO L271 PluginConnector]: Initializing CDTParser... [2022-12-13 19:47:05,256 INFO L275 PluginConnector]: CDTParser initialized [2022-12-13 19:47:05,257 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/../../sv-benchmarks/c/locks/test_locks_12.c [2022-12-13 19:47:07,707 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-12-13 19:47:07,857 INFO L351 CDTParser]: Found 1 translation units. [2022-12-13 19:47:07,858 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/sv-benchmarks/c/locks/test_locks_12.c [2022-12-13 19:47:07,863 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/data/55a9dd6db/3d593f78082b4db6a8abe496ac38f667/FLAGc34b1f36b [2022-12-13 19:47:08,283 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/data/55a9dd6db/3d593f78082b4db6a8abe496ac38f667 [2022-12-13 19:47:08,286 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-12-13 19:47:08,287 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-12-13 19:47:08,288 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-12-13 19:47:08,288 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-12-13 19:47:08,290 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-12-13 19:47:08,291 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,292 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cbdecb7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08, skipping insertion in model container [2022-12-13 19:47:08,292 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,297 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-12-13 19:47:08,310 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-12-13 19:47:08,416 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-12-13 19:47:08,417 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:47:08,426 INFO L203 MainTranslator]: Completed pre-run [2022-12-13 19:47:08,443 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2022-12-13 19:47:08,443 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-12-13 19:47:08,454 INFO L208 MainTranslator]: Completed translation [2022-12-13 19:47:08,454 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08 WrapperNode [2022-12-13 19:47:08,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-12-13 19:47:08,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-12-13 19:47:08,455 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-12-13 19:47:08,455 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-12-13 19:47:08,461 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,466 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,479 INFO L138 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2022-12-13 19:47:08,479 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-12-13 19:47:08,480 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-12-13 19:47:08,480 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-12-13 19:47:08,480 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-12-13 19:47:08,486 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,486 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,487 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,487 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,489 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,492 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,493 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,494 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,495 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-12-13 19:47:08,496 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-12-13 19:47:08,496 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-12-13 19:47:08,496 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-12-13 19:47:08,497 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (1/1) ... [2022-12-13 19:47:08,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-12-13 19:47:08,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/z3 [2022-12-13 19:47:08,521 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-12-13 19:47:08,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-12-13 19:47:08,557 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-12-13 19:47:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-12-13 19:47:08,558 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-12-13 19:47:08,558 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-12-13 19:47:08,612 INFO L235 CfgBuilder]: Building ICFG [2022-12-13 19:47:08,614 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-12-13 19:47:08,761 INFO L276 CfgBuilder]: Performing block encoding [2022-12-13 19:47:08,766 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-12-13 19:47:08,766 INFO L300 CfgBuilder]: Removed 1 assume(true) statements. [2022-12-13 19:47:08,768 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:47:08 BoogieIcfgContainer [2022-12-13 19:47:08,768 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-12-13 19:47:08,769 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-12-13 19:47:08,769 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-12-13 19:47:08,771 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-12-13 19:47:08,772 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 19:47:08,772 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 13.12 07:47:08" (1/3) ... [2022-12-13 19:47:08,772 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@263d8ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 07:47:08, skipping insertion in model container [2022-12-13 19:47:08,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 19:47:08,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.12 07:47:08" (2/3) ... [2022-12-13 19:47:08,773 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@263d8ac2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 13.12 07:47:08, skipping insertion in model container [2022-12-13 19:47:08,773 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-12-13 19:47:08,773 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:47:08" (3/3) ... [2022-12-13 19:47:08,774 INFO L332 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2022-12-13 19:47:08,829 INFO L303 stractBuchiCegarLoop]: Interprodecural is true [2022-12-13 19:47:08,829 INFO L304 stractBuchiCegarLoop]: Hoare is false [2022-12-13 19:47:08,829 INFO L305 stractBuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-12-13 19:47:08,830 INFO L306 stractBuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-12-13 19:47:08,830 INFO L307 stractBuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-12-13 19:47:08,830 INFO L308 stractBuchiCegarLoop]: Difference is false [2022-12-13 19:47:08,830 INFO L309 stractBuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-12-13 19:47:08,830 INFO L313 stractBuchiCegarLoop]: ======== Iteration 0 == of CEGAR loop == BuchiAutomatonCegarLoop ======== [2022-12-13 19:47:08,834 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-12-13 19:47:08,849 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 19:47:08,849 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:08,849 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:08,854 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:08,854 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-12-13 19:47:08,854 INFO L335 stractBuchiCegarLoop]: ======== Iteration 1 ============ [2022-12-13 19:47:08,854 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-12-13 19:47:08,857 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2022-12-13 19:47:08,857 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:08,857 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:08,858 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:08,858 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-12-13 19:47:08,864 INFO L748 eck$LassoCheckResult]: Stem: 45#$Ultimate##0true 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; 32#L183-1true [2022-12-13 19:47:08,865 INFO L750 eck$LassoCheckResult]: Loop: 32#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; 33#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; 34#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; 20#L98-1true assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 31#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; 40#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); 22#L153-1true assume !(0 != main_~p7~0#1); 37#L158-1true assume !(0 != main_~p8~0#1); 24#L163-1true assume !(0 != main_~p9~0#1); 39#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); 32#L183-1true [2022-12-13 19:47:08,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:08,870 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2022-12-13 19:47:08,877 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:08,877 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7353935] [2022-12-13 19:47:08,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:08,877 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:08,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:08,950 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:08,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:08,977 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:08,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:08,980 INFO L85 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2022-12-13 19:47:08,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:08,981 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1386754852] [2022-12-13 19:47:08,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:08,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:08,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:09,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1386754852] [2022-12-13 19:47:09,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1386754852] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404838179] [2022-12-13 19:47:09,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,092 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,117 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,118 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-12-13 19:47:09,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,151 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2022-12-13 19:47:09,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2022-12-13 19:47:09,156 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-12-13 19:47:09,160 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2022-12-13 19:47:09,161 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2022-12-13 19:47:09,161 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2022-12-13 19:47:09,162 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2022-12-13 19:47:09,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:09,162 INFO L218 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-12-13 19:47:09,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2022-12-13 19:47:09,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-12-13 19:47:09,183 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-12-13 19:47:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2022-12-13 19:47:09,185 INFO L240 hiAutomatonCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-12-13 19:47:09,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:09,188 INFO L428 stractBuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2022-12-13 19:47:09,188 INFO L335 stractBuchiCegarLoop]: ======== Iteration 2 ============ [2022-12-13 19:47:09,188 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2022-12-13 19:47:09,189 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2022-12-13 19:47:09,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:09,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:09,190 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:09,190 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-12-13 19:47:09,190 INFO L748 eck$LassoCheckResult]: Stem: 184#$Ultimate##0 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; 153#L183-1 [2022-12-13 19:47:09,190 INFO L750 eck$LassoCheckResult]: Loop: 153#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); 195#L78-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 194#L82-1 assume !(0 != main_~p3~0#1); 193#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 182#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 158#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 159#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 171#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 190#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 189#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 188#L114-1 assume !(0 != main_~p11~0#1); 187#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 185#L122-1 assume !(0 != main_~p1~0#1); 186#L128-1 assume !(0 != main_~p2~0#1); 216#L133-1 assume !(0 != main_~p3~0#1); 214#L138-1 assume !(0 != main_~p4~0#1); 212#L143-1 assume !(0 != main_~p5~0#1); 210#L148-1 assume !(0 != main_~p6~0#1); 208#L153-1 assume !(0 != main_~p7~0#1); 206#L158-1 assume !(0 != main_~p8~0#1); 204#L163-1 assume !(0 != main_~p9~0#1); 202#L168-1 assume !(0 != main_~p10~0#1); 199#L173-1 assume !(0 != main_~p11~0#1); 198#L178-1 assume !(0 != main_~p12~0#1); 153#L183-1 [2022-12-13 19:47:09,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,191 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2022-12-13 19:47:09,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,191 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968483087] [2022-12-13 19:47:09,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,196 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:09,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,201 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:09,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,201 INFO L85 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2022-12-13 19:47:09,201 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,202 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562340962] [2022-12-13 19:47:09,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,202 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:09,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,238 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562340962] [2022-12-13 19:47:09,238 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562340962] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,238 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,239 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122066384] [2022-12-13 19:47:09,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,239 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,240 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-12-13 19:47:09,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,259 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2022-12-13 19:47:09,259 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2022-12-13 19:47:09,262 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-12-13 19:47:09,264 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2022-12-13 19:47:09,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2022-12-13 19:47:09,264 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2022-12-13 19:47:09,264 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2022-12-13 19:47:09,265 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:09,265 INFO L218 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-12-13 19:47:09,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2022-12-13 19:47:09,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-12-13 19:47:09,273 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-12-13 19:47:09,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2022-12-13 19:47:09,275 INFO L240 hiAutomatonCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-12-13 19:47:09,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:09,276 INFO L428 stractBuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2022-12-13 19:47:09,276 INFO L335 stractBuchiCegarLoop]: ======== Iteration 3 ============ [2022-12-13 19:47:09,276 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2022-12-13 19:47:09,279 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2022-12-13 19:47:09,279 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:09,279 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:09,279 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:09,279 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-12-13 19:47:09,280 INFO L748 eck$LassoCheckResult]: Stem: 425#$Ultimate##0 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); 385#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; 386#L183-1 [2022-12-13 19:47:09,280 INFO L750 eck$LassoCheckResult]: Loop: 386#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 448#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; 446#L78 assume !(0 != main_~p1~0#1); 444#L78-2 assume !(0 != main_~p2~0#1); 445#L82-1 assume !(0 != main_~p3~0#1); 491#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 439#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 440#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 435#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 436#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 433#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 434#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 423#L114-1 assume !(0 != main_~p11~0#1); 424#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 426#L122-1 assume !(0 != main_~p1~0#1); 427#L128-1 assume !(0 != main_~p2~0#1); 490#L133-1 assume !(0 != main_~p3~0#1); 488#L138-1 assume !(0 != main_~p4~0#1); 484#L143-1 assume !(0 != main_~p5~0#1); 480#L148-1 assume !(0 != main_~p6~0#1); 476#L153-1 assume !(0 != main_~p7~0#1); 472#L158-1 assume !(0 != main_~p8~0#1); 468#L163-1 assume !(0 != main_~p9~0#1); 460#L168-1 assume !(0 != main_~p10~0#1); 455#L173-1 assume !(0 != main_~p11~0#1); 452#L178-1 assume !(0 != main_~p12~0#1); 386#L183-1 [2022-12-13 19:47:09,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,281 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2022-12-13 19:47:09,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,281 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373886360] [2022-12-13 19:47:09,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,287 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:09,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,292 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:09,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,293 INFO L85 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2022-12-13 19:47:09,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039864884] [2022-12-13 19:47:09,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,335 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:09,335 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039864884] [2022-12-13 19:47:09,336 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039864884] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,336 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,336 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [830473511] [2022-12-13 19:47:09,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,337 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,338 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-12-13 19:47:09,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,355 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2022-12-13 19:47:09,355 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2022-12-13 19:47:09,357 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-12-13 19:47:09,359 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2022-12-13 19:47:09,359 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2022-12-13 19:47:09,359 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2022-12-13 19:47:09,359 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2022-12-13 19:47:09,360 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:09,360 INFO L218 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-12-13 19:47:09,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2022-12-13 19:47:09,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2022-12-13 19:47:09,369 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-12-13 19:47:09,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2022-12-13 19:47:09,371 INFO L240 hiAutomatonCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-12-13 19:47:09,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:09,372 INFO L428 stractBuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2022-12-13 19:47:09,372 INFO L335 stractBuchiCegarLoop]: ======== Iteration 4 ============ [2022-12-13 19:47:09,372 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2022-12-13 19:47:09,375 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2022-12-13 19:47:09,375 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:09,375 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:09,375 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:09,375 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-12-13 19:47:09,376 INFO L748 eck$LassoCheckResult]: Stem: 872#$Ultimate##0 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-12-13 19:47:09,376 INFO L750 eck$LassoCheckResult]: Loop: 832#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 886#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; 883#L78 assume !(0 != main_~p1~0#1); 884#L78-2 assume !(0 != main_~p2~0#1); 962#L82-1 assume !(0 != main_~p3~0#1); 958#L86-1 assume !(0 != main_~p4~0#1); 955#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 952#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 949#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 946#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 943#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 940#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 937#L114-1 assume !(0 != main_~p11~0#1); 935#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 932#L122-1 assume !(0 != main_~p1~0#1); 929#L128-1 assume !(0 != main_~p2~0#1); 927#L133-1 assume !(0 != main_~p3~0#1); 922#L138-1 assume !(0 != main_~p4~0#1); 919#L143-1 assume !(0 != main_~p5~0#1); 915#L148-1 assume !(0 != main_~p6~0#1); 911#L153-1 assume !(0 != main_~p7~0#1); 907#L158-1 assume !(0 != main_~p8~0#1); 903#L163-1 assume !(0 != main_~p9~0#1); 899#L168-1 assume !(0 != main_~p10~0#1); 894#L173-1 assume !(0 != main_~p11~0#1); 891#L178-1 assume !(0 != main_~p12~0#1); 832#L183-1 [2022-12-13 19:47:09,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,376 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2022-12-13 19:47:09,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925642001] [2022-12-13 19:47:09,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,385 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:09,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2022-12-13 19:47:09,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,389 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683167776] [2022-12-13 19:47:09,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,390 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,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-12-13 19:47:09,417 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,417 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683167776] [2022-12-13 19:47:09,417 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683167776] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,417 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,417 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,417 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132330436] [2022-12-13 19:47:09,418 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,418 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,418 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,419 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-12-13 19:47:09,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,432 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2022-12-13 19:47:09,432 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2022-12-13 19:47:09,434 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-12-13 19:47:09,437 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2022-12-13 19:47:09,437 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2022-12-13 19:47:09,438 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2022-12-13 19:47:09,438 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2022-12-13 19:47:09,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:09,439 INFO L218 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-12-13 19:47:09,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2022-12-13 19:47:09,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2022-12-13 19:47:09,454 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-12-13 19:47:09,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2022-12-13 19:47:09,456 INFO L240 hiAutomatonCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-12-13 19:47:09,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:09,457 INFO L428 stractBuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2022-12-13 19:47:09,457 INFO L335 stractBuchiCegarLoop]: ======== Iteration 5 ============ [2022-12-13 19:47:09,457 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2022-12-13 19:47:09,462 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2022-12-13 19:47:09,462 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:09,462 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:09,462 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:09,462 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-12-13 19:47:09,462 INFO L748 eck$LassoCheckResult]: Stem: 1748#$Ultimate##0 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); 1710#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; 1711#L183-1 [2022-12-13 19:47:09,462 INFO L750 eck$LassoCheckResult]: Loop: 1711#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1766#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; 1767#L78 assume !(0 != main_~p1~0#1); 1866#L78-2 assume !(0 != main_~p2~0#1); 1864#L82-1 assume !(0 != main_~p3~0#1); 1860#L86-1 assume !(0 != main_~p4~0#1); 1858#L90-1 assume !(0 != main_~p5~0#1); 1856#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1854#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1852#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1850#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1848#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1846#L114-1 assume !(0 != main_~p11~0#1); 1844#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1840#L122-1 assume !(0 != main_~p1~0#1); 1836#L128-1 assume !(0 != main_~p2~0#1); 1833#L133-1 assume !(0 != main_~p3~0#1); 1828#L138-1 assume !(0 != main_~p4~0#1); 1825#L143-1 assume !(0 != main_~p5~0#1); 1826#L148-1 assume !(0 != main_~p6~0#1); 1803#L153-1 assume !(0 != main_~p7~0#1); 1802#L158-1 assume !(0 != main_~p8~0#1); 1792#L163-1 assume !(0 != main_~p9~0#1); 1788#L168-1 assume !(0 != main_~p10~0#1); 1787#L173-1 assume !(0 != main_~p11~0#1); 1776#L178-1 assume !(0 != main_~p12~0#1); 1711#L183-1 [2022-12-13 19:47:09,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,463 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2022-12-13 19:47:09,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672347628] [2022-12-13 19:47:09,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,471 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:09,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,477 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:09,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,477 INFO L85 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2022-12-13 19:47:09,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1796546080] [2022-12-13 19:47:09,478 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,499 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:09,499 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,499 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1796546080] [2022-12-13 19:47:09,500 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1796546080] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,500 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,500 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949746507] [2022-12-13 19:47:09,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,501 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,501 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-12-13 19:47:09,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,515 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2022-12-13 19:47:09,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2022-12-13 19:47:09,523 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-12-13 19:47:09,527 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-12-13 19:47:09,527 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2022-12-13 19:47:09,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2022-12-13 19:47:09,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2022-12-13 19:47:09,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:09,529 INFO L218 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-12-13 19:47:09,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2022-12-13 19:47:09,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2022-12-13 19:47:09,551 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-12-13 19:47:09,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2022-12-13 19:47:09,555 INFO L240 hiAutomatonCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-12-13 19:47:09,555 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:09,556 INFO L428 stractBuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2022-12-13 19:47:09,556 INFO L335 stractBuchiCegarLoop]: ======== Iteration 6 ============ [2022-12-13 19:47:09,556 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2022-12-13 19:47:09,565 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2022-12-13 19:47:09,565 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:09,565 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:09,566 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:09,566 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-12-13 19:47:09,566 INFO L748 eck$LassoCheckResult]: Stem: 3474#$Ultimate##0 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-12-13 19:47:09,566 INFO L750 eck$LassoCheckResult]: Loop: 3432#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3773#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; 3771#L78 assume !(0 != main_~p1~0#1); 3769#L78-2 assume !(0 != main_~p2~0#1); 3765#L82-1 assume !(0 != main_~p3~0#1); 3760#L86-1 assume !(0 != main_~p4~0#1); 3756#L90-1 assume !(0 != main_~p5~0#1); 3751#L94-1 assume !(0 != main_~p6~0#1); 3747#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3744#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3741#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3738#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3735#L114-1 assume !(0 != main_~p11~0#1); 3732#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3727#L122-1 assume !(0 != main_~p1~0#1); 3721#L128-1 assume !(0 != main_~p2~0#1); 3720#L133-1 assume !(0 != main_~p3~0#1); 3711#L138-1 assume !(0 != main_~p4~0#1); 3712#L143-1 assume !(0 != main_~p5~0#1); 3805#L148-1 assume !(0 != main_~p6~0#1); 3802#L153-1 assume !(0 != main_~p7~0#1); 3798#L158-1 assume !(0 != main_~p8~0#1); 3794#L163-1 assume !(0 != main_~p9~0#1); 3790#L168-1 assume !(0 != main_~p10~0#1); 3787#L173-1 assume !(0 != main_~p11~0#1); 3779#L178-1 assume !(0 != main_~p12~0#1); 3432#L183-1 [2022-12-13 19:47:09,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,567 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2022-12-13 19:47:09,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,567 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [916939277] [2022-12-13 19:47:09,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,573 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,579 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:09,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,579 INFO L85 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2022-12-13 19:47:09,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,580 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1110598051] [2022-12-13 19:47:09,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:09,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,608 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1110598051] [2022-12-13 19:47:09,608 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1110598051] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,608 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,608 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,608 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659166563] [2022-12-13 19:47:09,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,609 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,609 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,610 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-12-13 19:47:09,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,628 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2022-12-13 19:47:09,628 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2022-12-13 19:47:09,640 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-12-13 19:47:09,647 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-12-13 19:47:09,647 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2022-12-13 19:47:09,648 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2022-12-13 19:47:09,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2022-12-13 19:47:09,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:09,650 INFO L218 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-12-13 19:47:09,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2022-12-13 19:47:09,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2022-12-13 19:47:09,682 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-12-13 19:47:09,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2022-12-13 19:47:09,686 INFO L240 hiAutomatonCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-12-13 19:47:09,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:09,687 INFO L428 stractBuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2022-12-13 19:47:09,688 INFO L335 stractBuchiCegarLoop]: ======== Iteration 7 ============ [2022-12-13 19:47:09,688 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2022-12-13 19:47:09,696 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2022-12-13 19:47:09,696 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:09,696 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:09,697 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:09,697 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-12-13 19:47:09,697 INFO L748 eck$LassoCheckResult]: Stem: 6867#$Ultimate##0 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-12-13 19:47:09,697 INFO L750 eck$LassoCheckResult]: Loop: 6818#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 6938#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; 6936#L78 assume !(0 != main_~p1~0#1); 6932#L78-2 assume !(0 != main_~p2~0#1); 6930#L82-1 assume !(0 != main_~p3~0#1); 6926#L86-1 assume !(0 != main_~p4~0#1); 6922#L90-1 assume !(0 != main_~p5~0#1); 6918#L94-1 assume !(0 != main_~p6~0#1); 6914#L98-1 assume !(0 != main_~p7~0#1); 6912#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6910#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6908#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6906#L114-1 assume !(0 != main_~p11~0#1); 6904#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6901#L122-1 assume !(0 != main_~p1~0#1); 6902#L128-1 assume !(0 != main_~p2~0#1); 6978#L133-1 assume !(0 != main_~p3~0#1); 6973#L138-1 assume !(0 != main_~p4~0#1); 6969#L143-1 assume !(0 != main_~p5~0#1); 6965#L148-1 assume !(0 != main_~p6~0#1); 6961#L153-1 assume !(0 != main_~p7~0#1); 6958#L158-1 assume !(0 != main_~p8~0#1); 6954#L163-1 assume !(0 != main_~p9~0#1); 6950#L168-1 assume !(0 != main_~p10~0#1); 6945#L173-1 assume !(0 != main_~p11~0#1); 6942#L178-1 assume !(0 != main_~p12~0#1); 6818#L183-1 [2022-12-13 19:47:09,697 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,697 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2022-12-13 19:47:09,698 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,698 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [693305010] [2022-12-13 19:47:09,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,701 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:09,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,704 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:09,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,705 INFO L85 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2022-12-13 19:47:09,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693367645] [2022-12-13 19:47:09,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:09,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,722 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693367645] [2022-12-13 19:47:09,723 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693367645] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,723 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,723 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,723 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43983299] [2022-12-13 19:47:09,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,723 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,724 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,724 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-12-13 19:47:09,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,749 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2022-12-13 19:47:09,749 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2022-12-13 19:47:09,778 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-12-13 19:47:09,798 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-12-13 19:47:09,798 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2022-12-13 19:47:09,802 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2022-12-13 19:47:09,802 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2022-12-13 19:47:09,809 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:09,809 INFO L218 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-12-13 19:47:09,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2022-12-13 19:47:09,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2022-12-13 19:47:09,880 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-12-13 19:47:09,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2022-12-13 19:47:09,888 INFO L240 hiAutomatonCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-12-13 19:47:09,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:09,889 INFO L428 stractBuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2022-12-13 19:47:09,889 INFO L335 stractBuchiCegarLoop]: ======== Iteration 8 ============ [2022-12-13 19:47:09,889 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2022-12-13 19:47:09,901 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2022-12-13 19:47:09,901 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:09,901 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:09,902 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:09,902 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-12-13 19:47:09,902 INFO L748 eck$LassoCheckResult]: Stem: 13539#$Ultimate##0 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); 13483#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; 13484#L183-1 [2022-12-13 19:47:09,902 INFO L750 eck$LassoCheckResult]: Loop: 13484#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 13925#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; 13923#L78 assume !(0 != main_~p1~0#1); 13916#L78-2 assume !(0 != main_~p2~0#1); 13918#L82-1 assume !(0 != main_~p3~0#1); 13911#L86-1 assume !(0 != main_~p4~0#1); 13913#L90-1 assume !(0 != main_~p5~0#1); 13906#L94-1 assume !(0 != main_~p6~0#1); 13907#L98-1 assume !(0 != main_~p7~0#1); 13900#L102-1 assume !(0 != main_~p8~0#1); 13902#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 13896#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 13897#L114-1 assume !(0 != main_~p11~0#1); 13888#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13889#L122-1 assume !(0 != main_~p1~0#1); 13964#L128-1 assume !(0 != main_~p2~0#1); 13963#L133-1 assume !(0 != main_~p3~0#1); 13959#L138-1 assume !(0 != main_~p4~0#1); 13956#L143-1 assume !(0 != main_~p5~0#1); 13953#L148-1 assume !(0 != main_~p6~0#1); 13949#L153-1 assume !(0 != main_~p7~0#1); 13945#L158-1 assume !(0 != main_~p8~0#1); 13942#L163-1 assume !(0 != main_~p9~0#1); 13938#L168-1 assume !(0 != main_~p10~0#1); 13933#L173-1 assume !(0 != main_~p11~0#1); 13930#L178-1 assume !(0 != main_~p12~0#1); 13484#L183-1 [2022-12-13 19:47:09,902 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,902 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2022-12-13 19:47:09,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,903 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320143905] [2022-12-13 19:47:09,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,906 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:09,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:09,909 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:09,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:09,909 INFO L85 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2022-12-13 19:47:09,909 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:09,909 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1971865417] [2022-12-13 19:47:09,909 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:09,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:09,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:09,926 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:09,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:09,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1971865417] [2022-12-13 19:47:09,926 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1971865417] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:09,926 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:09,927 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:09,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [507891615] [2022-12-13 19:47:09,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:09,927 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:09,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:09,928 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:09,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:09,928 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-12-13 19:47:09,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:09,958 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2022-12-13 19:47:09,958 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2022-12-13 19:47:10,013 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-12-13 19:47:10,034 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-12-13 19:47:10,034 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2022-12-13 19:47:10,039 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2022-12-13 19:47:10,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2022-12-13 19:47:10,044 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:10,044 INFO L218 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-12-13 19:47:10,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2022-12-13 19:47:10,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2022-12-13 19:47:10,168 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-12-13 19:47:10,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2022-12-13 19:47:10,182 INFO L240 hiAutomatonCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-12-13 19:47:10,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:10,183 INFO L428 stractBuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2022-12-13 19:47:10,183 INFO L335 stractBuchiCegarLoop]: ======== Iteration 9 ============ [2022-12-13 19:47:10,183 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2022-12-13 19:47:10,215 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2022-12-13 19:47:10,215 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:10,215 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:10,215 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:10,215 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-12-13 19:47:10,215 INFO L748 eck$LassoCheckResult]: Stem: 26664#$Ultimate##0 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-12-13 19:47:10,215 INFO L750 eck$LassoCheckResult]: Loop: 26613#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 27094#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; 27092#L78 assume !(0 != main_~p1~0#1); 27090#L78-2 assume !(0 != main_~p2~0#1); 27086#L82-1 assume !(0 != main_~p3~0#1); 27079#L86-1 assume !(0 != main_~p4~0#1); 27071#L90-1 assume !(0 != main_~p5~0#1); 27066#L94-1 assume !(0 != main_~p6~0#1); 27059#L98-1 assume !(0 != main_~p7~0#1); 27051#L102-1 assume !(0 != main_~p8~0#1); 27043#L106-1 assume !(0 != main_~p9~0#1); 27038#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 27034#L114-1 assume !(0 != main_~p11~0#1); 27030#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 27026#L122-1 assume !(0 != main_~p1~0#1); 27027#L128-1 assume !(0 != main_~p2~0#1); 27015#L133-1 assume !(0 != main_~p3~0#1); 27014#L138-1 assume !(0 != main_~p4~0#1); 26996#L143-1 assume !(0 != main_~p5~0#1); 26998#L148-1 assume !(0 != main_~p6~0#1); 27117#L153-1 assume !(0 != main_~p7~0#1); 27113#L158-1 assume !(0 != main_~p8~0#1); 27109#L163-1 assume !(0 != main_~p9~0#1); 27106#L168-1 assume !(0 != main_~p10~0#1); 27101#L173-1 assume !(0 != main_~p11~0#1); 27098#L178-1 assume !(0 != main_~p12~0#1); 26613#L183-1 [2022-12-13 19:47:10,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:10,216 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2022-12-13 19:47:10,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:10,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694973576] [2022-12-13 19:47:10,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:10,216 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:10,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:10,219 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:10,221 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:10,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:10,222 INFO L85 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2022-12-13 19:47:10,222 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:10,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8630107] [2022-12-13 19:47:10,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:10,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:10,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:10,237 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:10,237 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:10,237 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8630107] [2022-12-13 19:47:10,237 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8630107] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:10,237 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:10,238 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-12-13 19:47:10,238 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114107801] [2022-12-13 19:47:10,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:10,238 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:10,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:10,238 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:10,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:10,239 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-12-13 19:47:10,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:10,289 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2022-12-13 19:47:10,289 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2022-12-13 19:47:10,373 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-12-13 19:47:10,431 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-12-13 19:47:10,431 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2022-12-13 19:47:10,439 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2022-12-13 19:47:10,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2022-12-13 19:47:10,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:10,450 INFO L218 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-12-13 19:47:10,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2022-12-13 19:47:10,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2022-12-13 19:47:10,649 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-12-13 19:47:10,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2022-12-13 19:47:10,709 INFO L240 hiAutomatonCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-12-13 19:47:10,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:10,710 INFO L428 stractBuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2022-12-13 19:47:10,710 INFO L335 stractBuchiCegarLoop]: ======== Iteration 10 ============ [2022-12-13 19:47:10,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2022-12-13 19:47:10,758 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2022-12-13 19:47:10,758 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:10,758 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:10,758 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:10,759 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-12-13 19:47:10,759 INFO L748 eck$LassoCheckResult]: Stem: 52529#$Ultimate##0 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-12-13 19:47:10,759 INFO L750 eck$LassoCheckResult]: Loop: 52480#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 52908#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; 52906#L78 assume !(0 != main_~p1~0#1); 52902#L78-2 assume !(0 != main_~p2~0#1); 52900#L82-1 assume !(0 != main_~p3~0#1); 52893#L86-1 assume !(0 != main_~p4~0#1); 52884#L90-1 assume !(0 != main_~p5~0#1); 52885#L94-1 assume !(0 != main_~p6~0#1); 52881#L98-1 assume !(0 != main_~p7~0#1); 52873#L102-1 assume !(0 != main_~p8~0#1); 52865#L106-1 assume !(0 != main_~p9~0#1); 52857#L110-1 assume !(0 != main_~p10~0#1); 52850#L114-1 assume !(0 != main_~p11~0#1); 52721#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 52722#L122-1 assume !(0 != main_~p1~0#1); 52829#L128-1 assume !(0 != main_~p2~0#1); 52831#L133-1 assume !(0 != main_~p3~0#1); 52817#L138-1 assume !(0 != main_~p4~0#1); 52818#L143-1 assume !(0 != main_~p5~0#1); 52935#L148-1 assume !(0 != main_~p6~0#1); 52931#L153-1 assume !(0 != main_~p7~0#1); 52927#L158-1 assume !(0 != main_~p8~0#1); 52923#L163-1 assume !(0 != main_~p9~0#1); 52919#L168-1 assume !(0 != main_~p10~0#1); 52915#L173-1 assume !(0 != main_~p11~0#1); 52912#L178-1 assume !(0 != main_~p12~0#1); 52480#L183-1 [2022-12-13 19:47:10,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:10,759 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2022-12-13 19:47:10,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:10,760 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [332767114] [2022-12-13 19:47:10,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:10,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:10,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:10,763 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:10,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:10,780 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:10,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:10,780 INFO L85 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2022-12-13 19:47:10,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:10,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930521666] [2022-12-13 19:47:10,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:10,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-12-13 19:47:10,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-12-13 19:47:10,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-12-13 19:47:10,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930521666] [2022-12-13 19:47:10,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930521666] provided 1 perfect and 0 imperfect interpolant sequences [2022-12-13 19:47:10,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-12-13 19:47:10,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-12-13 19:47:10,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274897142] [2022-12-13 19:47:10,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-12-13 19:47:10,800 INFO L765 eck$LassoCheckResult]: loop already infeasible [2022-12-13 19:47:10,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-12-13 19:47:10,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-12-13 19:47:10,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-12-13 19:47:10,801 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-12-13 19:47:10,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-12-13 19:47:10,888 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2022-12-13 19:47:10,888 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2022-12-13 19:47:11,056 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2022-12-13 19:47:11,124 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2022-12-13 19:47:11,124 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2022-12-13 19:47:11,137 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2022-12-13 19:47:11,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2022-12-13 19:47:11,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-12-13 19:47:11,154 INFO L218 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-12-13 19:47:11,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2022-12-13 19:47:11,463 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2022-12-13 19:47:11,492 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-12-13 19:47:11,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2022-12-13 19:47:11,577 INFO L240 hiAutomatonCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-12-13 19:47:11,577 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-12-13 19:47:11,578 INFO L428 stractBuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2022-12-13 19:47:11,578 INFO L335 stractBuchiCegarLoop]: ======== Iteration 11 ============ [2022-12-13 19:47:11,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2022-12-13 19:47:11,653 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2022-12-13 19:47:11,653 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-12-13 19:47:11,654 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-12-13 19:47:11,654 INFO L148 hiAutomatonCegarLoop]: Counterexample stem histogram [1, 1] [2022-12-13 19:47:11,654 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-12-13 19:47:11,654 INFO L748 eck$LassoCheckResult]: Stem: 103482#$Ultimate##0 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); 103433#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; 103434#L183-1 [2022-12-13 19:47:11,655 INFO L750 eck$LassoCheckResult]: Loop: 103434#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 103586#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; 103584#L78 assume !(0 != main_~p1~0#1); 103580#L78-2 assume !(0 != main_~p2~0#1); 103578#L82-1 assume !(0 != main_~p3~0#1); 103574#L86-1 assume !(0 != main_~p4~0#1); 103570#L90-1 assume !(0 != main_~p5~0#1); 103566#L94-1 assume !(0 != main_~p6~0#1); 103562#L98-1 assume !(0 != main_~p7~0#1); 103558#L102-1 assume !(0 != main_~p8~0#1); 103554#L106-1 assume !(0 != main_~p9~0#1); 103550#L110-1 assume !(0 != main_~p10~0#1); 103548#L114-1 assume !(0 != main_~p11~0#1); 103544#L118-1 assume !(0 != main_~p12~0#1); 103541#L122-1 assume !(0 != main_~p1~0#1); 103542#L128-1 assume !(0 != main_~p2~0#1); 103626#L133-1 assume !(0 != main_~p3~0#1); 103621#L138-1 assume !(0 != main_~p4~0#1); 103617#L143-1 assume !(0 != main_~p5~0#1); 103613#L148-1 assume !(0 != main_~p6~0#1); 103609#L153-1 assume !(0 != main_~p7~0#1); 103605#L158-1 assume !(0 != main_~p8~0#1); 103601#L163-1 assume !(0 != main_~p9~0#1); 103597#L168-1 assume !(0 != main_~p10~0#1); 103593#L173-1 assume !(0 != main_~p11~0#1); 103589#L178-1 assume !(0 != main_~p12~0#1); 103434#L183-1 [2022-12-13 19:47:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:11,655 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2022-12-13 19:47:11,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:11,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800871655] [2022-12-13 19:47:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:11,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:11,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:11,660 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:11,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:11,663 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:11,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:11,664 INFO L85 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2022-12-13 19:47:11,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:11,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1647560980] [2022-12-13 19:47:11,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:11,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:11,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:11,669 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:11,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:11,676 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:11,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-12-13 19:47:11,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2022-12-13 19:47:11,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-12-13 19:47:11,677 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1263853496] [2022-12-13 19:47:11,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-12-13 19:47:11,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-12-13 19:47:11,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:11,682 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:11,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:11,688 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-12-13 19:47:12,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:12,063 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-12-13 19:47:12,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-12-13 19:47:12,092 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 13.12 07:47:12 BoogieIcfgContainer [2022-12-13 19:47:12,092 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-12-13 19:47:12,092 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-12-13 19:47:12,092 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-12-13 19:47:12,093 INFO L275 PluginConnector]: Witness Printer initialized [2022-12-13 19:47:12,093 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.12 07:47:08" (3/4) ... [2022-12-13 19:47:12,095 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-12-13 19:47:12,124 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/witness.graphml [2022-12-13 19:47:12,124 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-12-13 19:47:12,125 INFO L158 Benchmark]: Toolchain (without parser) took 3837.93ms. Allocated memory was 111.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 78.4MB in the beginning and 848.7MB in the end (delta: -770.3MB). Peak memory consumption was 331.4MB. Max. memory is 16.1GB. [2022-12-13 19:47:12,125 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 111.1MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-12-13 19:47:12,125 INFO L158 Benchmark]: CACSL2BoogieTranslator took 166.77ms. Allocated memory is still 111.1MB. Free memory was 78.1MB in the beginning and 67.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-12-13 19:47:12,125 INFO L158 Benchmark]: Boogie Procedure Inliner took 24.44ms. Allocated memory is still 111.1MB. Free memory was 67.1MB in the beginning and 65.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:47:12,126 INFO L158 Benchmark]: Boogie Preprocessor took 15.86ms. Allocated memory is still 111.1MB. Free memory was 65.3MB in the beginning and 63.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:47:12,126 INFO L158 Benchmark]: RCFGBuilder took 272.06ms. Allocated memory is still 111.1MB. Free memory was 63.8MB in the beginning and 50.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-12-13 19:47:12,126 INFO L158 Benchmark]: BuchiAutomizer took 3323.34ms. Allocated memory was 111.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 50.7MB in the beginning and 851.7MB in the end (delta: -801.0MB). Peak memory consumption was 302.1MB. Max. memory is 16.1GB. [2022-12-13 19:47:12,126 INFO L158 Benchmark]: Witness Printer took 31.84ms. Allocated memory is still 1.2GB. Free memory was 851.7MB in the beginning and 848.7MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-12-13 19:47:12,128 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.11ms. Allocated memory is still 111.1MB. Free memory is still 82.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 166.77ms. Allocated memory is still 111.1MB. Free memory was 78.1MB in the beginning and 67.1MB in the end (delta: 11.0MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 24.44ms. Allocated memory is still 111.1MB. Free memory was 67.1MB in the beginning and 65.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 15.86ms. Allocated memory is still 111.1MB. Free memory was 65.3MB in the beginning and 63.8MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 272.06ms. Allocated memory is still 111.1MB. Free memory was 63.8MB in the beginning and 50.7MB in the end (delta: 13.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3323.34ms. Allocated memory was 111.1MB in the beginning and 1.2GB in the end (delta: 1.1GB). Free memory was 50.7MB in the beginning and 851.7MB in the end (delta: -801.0MB). Peak memory consumption was 302.1MB. Max. memory is 16.1GB. * Witness Printer took 31.84ms. Allocated memory is still 1.2GB. Free memory was 851.7MB in the beginning and 848.7MB in the end (delta: 3.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 3.2s and 11 iterations. TraceHistogramMax:1. Analysis of lassos took 0.9s. Construction of modules took 0.0s. Büchi inclusion checks took 1.9s. Highest rank in rank-based complementation 0. Minimization of det autom 10. Minimization of nondet autom 0. Automata minimization 1.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.5s 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.1s 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-12-13 19:47:12,147 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a0e38c68-3ee7-4e0d-bb30-846854aef4b7/bin/uautomizer-uyxdKDjOR8/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)