./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 3a877d22 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/locks/test_locks_12.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 --- This is Ultimate 0.2.2-3a877d227dc491413fd706022d0c47cd97beb353-3a877d2 [2021-12-15 17:06:56,245 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-12-15 17:06:56,246 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-12-15 17:06:56,290 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-12-15 17:06:56,291 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-12-15 17:06:56,293 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-12-15 17:06:56,294 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-12-15 17:06:56,296 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-12-15 17:06:56,298 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-12-15 17:06:56,301 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-12-15 17:06:56,302 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-12-15 17:06:56,303 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-12-15 17:06:56,303 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-12-15 17:06:56,305 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-12-15 17:06:56,306 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-12-15 17:06:56,311 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-12-15 17:06:56,312 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-12-15 17:06:56,312 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-12-15 17:06:56,314 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-12-15 17:06:56,319 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-12-15 17:06:56,321 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-12-15 17:06:56,321 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-12-15 17:06:56,323 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-12-15 17:06:56,323 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-12-15 17:06:56,328 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-12-15 17:06:56,328 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-12-15 17:06:56,328 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-12-15 17:06:56,330 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-12-15 17:06:56,330 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-12-15 17:06:56,331 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-12-15 17:06:56,331 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-12-15 17:06:56,332 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-12-15 17:06:56,333 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-12-15 17:06:56,334 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-12-15 17:06:56,334 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-12-15 17:06:56,335 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-12-15 17:06:56,335 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-12-15 17:06:56,335 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-12-15 17:06:56,335 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-12-15 17:06:56,337 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-12-15 17:06:56,337 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-12-15 17:06:56,338 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2021-12-15 17:06:56,361 INFO L113 SettingsManager]: Loading preferences was successful [2021-12-15 17:06:56,366 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-12-15 17:06:56,367 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2021-12-15 17:06:56,367 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2021-12-15 17:06:56,368 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-12-15 17:06:56,368 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-12-15 17:06:56,368 INFO L138 SettingsManager]: * Use SBE=true [2021-12-15 17:06:56,369 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2021-12-15 17:06:56,369 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2021-12-15 17:06:56,369 INFO L138 SettingsManager]: * Use old map elimination=false [2021-12-15 17:06:56,370 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2021-12-15 17:06:56,370 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2021-12-15 17:06:56,370 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2021-12-15 17:06:56,370 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-12-15 17:06:56,370 INFO L138 SettingsManager]: * sizeof long=4 [2021-12-15 17:06:56,370 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-12-15 17:06:56,371 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-12-15 17:06:56,371 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-12-15 17:06:56,371 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-12-15 17:06:56,371 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2021-12-15 17:06:56,371 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2021-12-15 17:06:56,371 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2021-12-15 17:06:56,372 INFO L138 SettingsManager]: * sizeof long double=12 [2021-12-15 17:06:56,372 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-12-15 17:06:56,372 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2021-12-15 17:06:56,372 INFO L138 SettingsManager]: * Use constant arrays=true [2021-12-15 17:06:56,372 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2021-12-15 17:06:56,372 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-12-15 17:06:56,373 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2021-12-15 17:06:56,373 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-12-15 17:06:56,373 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2021-12-15 17:06:56,373 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-12-15 17:06:56,374 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2021-12-15 17:06:56,374 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:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 [2021-12-15 17:06:56,541 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-12-15 17:06:56,560 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-12-15 17:06:56,562 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-12-15 17:06:56,563 INFO L271 PluginConnector]: Initializing CDTParser... [2021-12-15 17:06:56,563 INFO L275 PluginConnector]: CDTParser initialized [2021-12-15 17:06:56,564 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_12.c [2021-12-15 17:06:56,623 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49a4ed8e/6c7a3eec3ea1459c9aa09f32df7f5f7f/FLAGd13711e22 [2021-12-15 17:06:57,010 INFO L306 CDTParser]: Found 1 translation units. [2021-12-15 17:06:57,011 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c [2021-12-15 17:06:57,015 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49a4ed8e/6c7a3eec3ea1459c9aa09f32df7f5f7f/FLAGd13711e22 [2021-12-15 17:06:57,025 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d49a4ed8e/6c7a3eec3ea1459c9aa09f32df7f5f7f [2021-12-15 17:06:57,026 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-12-15 17:06:57,028 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-12-15 17:06:57,029 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:57,029 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-12-15 17:06:57,031 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-12-15 17:06:57,032 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,033 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@79d747e8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57, skipping insertion in model container [2021-12-15 17:06:57,033 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,037 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-12-15 17:06:57,058 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-12-15 17:06:57,187 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2021-12-15 17:06:57,189 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:57,195 INFO L203 MainTranslator]: Completed pre-run [2021-12-15 17:06:57,232 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_12.c[4591,4604] [2021-12-15 17:06:57,233 INFO L209 PostProcessor]: Analyzing one entry point: main [2021-12-15 17:06:57,241 INFO L208 MainTranslator]: Completed translation [2021-12-15 17:06:57,242 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57 WrapperNode [2021-12-15 17:06:57,242 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-12-15 17:06:57,243 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:57,243 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-12-15 17:06:57,243 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-12-15 17:06:57,248 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,253 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,271 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 147 [2021-12-15 17:06:57,275 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-12-15 17:06:57,275 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-12-15 17:06:57,275 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-12-15 17:06:57,276 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-12-15 17:06:57,281 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,281 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,290 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,290 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,293 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,296 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,297 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,299 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-12-15 17:06:57,299 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-12-15 17:06:57,299 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-12-15 17:06:57,299 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-12-15 17:06:57,300 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (1/1) ... [2021-12-15 17:06:57,311 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2021-12-15 17:06:57,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2021-12-15 17:06:57,334 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2021-12-15 17:06:57,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2021-12-15 17:06:57,364 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2021-12-15 17:06:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-12-15 17:06:57,365 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-12-15 17:06:57,365 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-12-15 17:06:57,415 INFO L236 CfgBuilder]: Building ICFG [2021-12-15 17:06:57,416 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2021-12-15 17:06:57,536 INFO L277 CfgBuilder]: Performing block encoding [2021-12-15 17:06:57,541 INFO L296 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-12-15 17:06:57,541 INFO L301 CfgBuilder]: Removed 1 assume(true) statements. [2021-12-15 17:06:57,542 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:57 BoogieIcfgContainer [2021-12-15 17:06:57,554 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-12-15 17:06:57,555 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2021-12-15 17:06:57,555 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2021-12-15 17:06:57,557 INFO L275 PluginConnector]: BuchiAutomizer initialized [2021-12-15 17:06:57,558 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:57,558 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.12 05:06:57" (1/3) ... [2021-12-15 17:06:57,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56f035ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:57, skipping insertion in model container [2021-12-15 17:06:57,559 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:57,559 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.12 05:06:57" (2/3) ... [2021-12-15 17:06:57,559 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@56f035ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.12 05:06:57, skipping insertion in model container [2021-12-15 17:06:57,560 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2021-12-15 17:06:57,560 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.12 05:06:57" (3/3) ... [2021-12-15 17:06:57,561 INFO L388 chiAutomizerObserver]: Analyzing ICFG test_locks_12.c [2021-12-15 17:06:57,616 INFO L359 BuchiCegarLoop]: Interprodecural is true [2021-12-15 17:06:57,616 INFO L360 BuchiCegarLoop]: Hoare is false [2021-12-15 17:06:57,616 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2021-12-15 17:06:57,627 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2021-12-15 17:06:57,627 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-12-15 17:06:57,627 INFO L364 BuchiCegarLoop]: Difference is false [2021-12-15 17:06:57,627 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-12-15 17:06:57,627 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2021-12-15 17:06:57,640 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) [2021-12-15 17:06:57,656 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2021-12-15 17:06:57,657 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,657 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,661 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,661 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:57,661 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2021-12-15 17:06:57,662 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) [2021-12-15 17:06:57,664 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 38 [2021-12-15 17:06:57,664 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:57,664 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:57,666 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:57,666 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:57,671 INFO L791 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 7#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; 34#L183-1true [2021-12-15 17:06:57,672 INFO L793 eck$LassoCheckResult]: Loop: 34#L183-1true assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 18#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; 35#L78true assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; 15#L78-2true assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 13#L82-1true assume !(0 != main_~p3~0#1); 9#L86-1true assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 36#L90-1true assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 12#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; 33#L102-1true assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 16#L106-1true assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 26#L110-1true assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 42#L114-1true assume !(0 != main_~p11~0#1); 31#L118-1true assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 14#L122-1true assume !(0 != main_~p1~0#1); 28#L128-1true assume !(0 != main_~p2~0#1); 5#L133-1true assume !(0 != main_~p3~0#1); 4#L138-1true assume !(0 != main_~p4~0#1); 27#L143-1true assume !(0 != main_~p5~0#1); 6#L148-1true assume !(0 != main_~p6~0#1); 22#L153-1true assume !(0 != main_~p7~0#1); 39#L158-1true assume !(0 != main_~p8~0#1); 24#L163-1true assume !(0 != main_~p9~0#1); 41#L168-1true assume !(0 != main_~p10~0#1); 19#L173-1true assume !(0 != main_~p11~0#1); 8#L178-1true assume !(0 != main_~p12~0#1); 34#L183-1true [2021-12-15 17:06:57,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,677 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2021-12-15 17:06:57,682 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,683 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007823556] [2021-12-15 17:06:57,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,684 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,762 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:57,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:57,794 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:57,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:57,797 INFO L85 PathProgramCache]: Analyzing trace with hash -819199544, now seen corresponding path program 1 times [2021-12-15 17:06:57,798 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:57,798 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225265405] [2021-12-15 17:06:57,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:57,799 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:57,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:57,897 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:57,897 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:57,897 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225265405] [2021-12-15 17:06:57,898 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225265405] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:57,898 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:57,898 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:57,899 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [225196938] [2021-12-15 17:06:57,900 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:57,905 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:57,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:57,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:57,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:57,936 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) [2021-12-15 17:06:57,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:57,973 INFO L93 Difference]: Finished difference Result 87 states and 154 transitions. [2021-12-15 17:06:57,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:57,979 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 154 transitions. [2021-12-15 17:06:57,986 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2021-12-15 17:06:57,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 77 states and 123 transitions. [2021-12-15 17:06:57,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 77 [2021-12-15 17:06:57,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 77 [2021-12-15 17:06:57,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 77 states and 123 transitions. [2021-12-15 17:06:57,995 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:57,995 INFO L681 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2021-12-15 17:06:58,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states and 123 transitions. [2021-12-15 17:06:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2021-12-15 17:06:58,019 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) [2021-12-15 17:06:58,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 123 transitions. [2021-12-15 17:06:58,021 INFO L704 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2021-12-15 17:06:58,021 INFO L587 BuchiCegarLoop]: Abstraction has 77 states and 123 transitions. [2021-12-15 17:06:58,022 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2021-12-15 17:06:58,022 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 77 states and 123 transitions. [2021-12-15 17:06:58,027 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 75 [2021-12-15 17:06:58,028 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,028 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,029 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,030 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:58,030 INFO L791 eck$LassoCheckResult]: Stem: 176#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 152#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 151#L183-1 [2021-12-15 17:06:58,030 INFO L793 eck$LassoCheckResult]: Loop: 151#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 167#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 168#L78 assume !(0 != main_~p1~0#1); 196#L78-2 assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; 195#L82-1 assume !(0 != main_~p3~0#1); 153#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 154#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 194#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 193#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 192#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 191#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 190#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 187#L114-1 assume !(0 != main_~p11~0#1); 188#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 189#L122-1 assume !(0 != main_~p1~0#1); 179#L128-1 assume !(0 != main_~p2~0#1); 144#L133-1 assume !(0 != main_~p3~0#1); 141#L138-1 assume !(0 != main_~p4~0#1); 142#L143-1 assume !(0 != main_~p5~0#1); 146#L148-1 assume !(0 != main_~p6~0#1); 148#L153-1 assume !(0 != main_~p7~0#1); 156#L158-1 assume !(0 != main_~p8~0#1); 205#L163-1 assume !(0 != main_~p9~0#1); 185#L168-1 assume !(0 != main_~p10~0#1); 169#L173-1 assume !(0 != main_~p11~0#1); 149#L178-1 assume !(0 != main_~p12~0#1); 151#L183-1 [2021-12-15 17:06:58,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,032 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times [2021-12-15 17:06:58,032 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657924860] [2021-12-15 17:06:58,033 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,033 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,040 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,050 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,052 INFO L85 PathProgramCache]: Analyzing trace with hash -953213050, now seen corresponding path program 1 times [2021-12-15 17:06:58,052 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,052 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1799789787] [2021-12-15 17:06:58,053 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,055 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,089 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,089 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1799789787] [2021-12-15 17:06:58,089 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1799789787] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,089 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,089 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,090 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963326633] [2021-12-15 17:06:58,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,090 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,090 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,091 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) [2021-12-15 17:06:58,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,111 INFO L93 Difference]: Finished difference Result 150 states and 238 transitions. [2021-12-15 17:06:58,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,115 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 150 states and 238 transitions. [2021-12-15 17:06:58,116 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2021-12-15 17:06:58,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 150 states to 150 states and 238 transitions. [2021-12-15 17:06:58,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 150 [2021-12-15 17:06:58,118 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 150 [2021-12-15 17:06:58,118 INFO L73 IsDeterministic]: Start isDeterministic. Operand 150 states and 238 transitions. [2021-12-15 17:06:58,118 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,119 INFO L681 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2021-12-15 17:06:58,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states and 238 transitions. [2021-12-15 17:06:58,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2021-12-15 17:06:58,128 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) [2021-12-15 17:06:58,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 238 transitions. [2021-12-15 17:06:58,131 INFO L704 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2021-12-15 17:06:58,131 INFO L587 BuchiCegarLoop]: Abstraction has 150 states and 238 transitions. [2021-12-15 17:06:58,131 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2021-12-15 17:06:58,132 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 150 states and 238 transitions. [2021-12-15 17:06:58,133 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 148 [2021-12-15 17:06:58,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,135 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,136 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,136 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:58,136 INFO L791 eck$LassoCheckResult]: Stem: 414#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 386#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 387#L183-1 [2021-12-15 17:06:58,137 INFO L793 eck$LassoCheckResult]: Loop: 387#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 405#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 406#L78 assume !(0 != main_~p1~0#1); 483#L78-2 assume !(0 != main_~p2~0#1); 396#L82-1 assume !(0 != main_~p3~0#1); 390#L86-1 assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; 391#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 475#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 471#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 469#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 466#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 464#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 427#L114-1 assume !(0 != main_~p11~0#1); 419#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 420#L122-1 assume !(0 != main_~p1~0#1); 458#L128-1 assume !(0 != main_~p2~0#1); 377#L133-1 assume !(0 != main_~p3~0#1); 379#L138-1 assume !(0 != main_~p4~0#1); 448#L143-1 assume !(0 != main_~p5~0#1); 446#L148-1 assume !(0 != main_~p6~0#1); 444#L153-1 assume !(0 != main_~p7~0#1); 424#L158-1 assume !(0 != main_~p8~0#1); 409#L163-1 assume !(0 != main_~p9~0#1); 411#L168-1 assume !(0 != main_~p10~0#1); 439#L173-1 assume !(0 != main_~p11~0#1); 434#L178-1 assume !(0 != main_~p12~0#1); 387#L183-1 [2021-12-15 17:06:58,137 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,137 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times [2021-12-15 17:06:58,138 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [762126259] [2021-12-15 17:06:58,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,138 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,142 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,146 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1536315912, now seen corresponding path program 1 times [2021-12-15 17:06:58,146 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,146 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202436564] [2021-12-15 17:06:58,146 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,147 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,178 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,178 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [202436564] [2021-12-15 17:06:58,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [202436564] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,179 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,179 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,179 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66267474] [2021-12-15 17:06:58,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,181 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,181 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,182 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) [2021-12-15 17:06:58,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,211 INFO L93 Difference]: Finished difference Result 294 states and 462 transitions. [2021-12-15 17:06:58,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 294 states and 462 transitions. [2021-12-15 17:06:58,214 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2021-12-15 17:06:58,216 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 294 states to 294 states and 462 transitions. [2021-12-15 17:06:58,216 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 294 [2021-12-15 17:06:58,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 294 [2021-12-15 17:06:58,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 294 states and 462 transitions. [2021-12-15 17:06:58,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,218 INFO L681 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2021-12-15 17:06:58,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 294 states and 462 transitions. [2021-12-15 17:06:58,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 294 to 294. [2021-12-15 17:06:58,227 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) [2021-12-15 17:06:58,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 294 states to 294 states and 462 transitions. [2021-12-15 17:06:58,228 INFO L704 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2021-12-15 17:06:58,228 INFO L587 BuchiCegarLoop]: Abstraction has 294 states and 462 transitions. [2021-12-15 17:06:58,228 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2021-12-15 17:06:58,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 294 states and 462 transitions. [2021-12-15 17:06:58,233 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 292 [2021-12-15 17:06:58,233 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,233 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,233 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,233 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:58,233 INFO L791 eck$LassoCheckResult]: Stem: 860#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 831#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 832#L183-1 [2021-12-15 17:06:58,233 INFO L793 eck$LassoCheckResult]: Loop: 832#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 936#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 930#L78 assume !(0 != main_~p1~0#1); 931#L78-2 assume !(0 != main_~p2~0#1); 1011#L82-1 assume !(0 != main_~p3~0#1); 1007#L86-1 assume !(0 != main_~p4~0#1); 1004#L90-1 assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; 1001#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 998#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 995#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 992#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 989#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 986#L114-1 assume !(0 != main_~p11~0#1); 981#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 932#L122-1 assume !(0 != main_~p1~0#1); 933#L128-1 assume !(0 != main_~p2~0#1); 977#L133-1 assume !(0 != main_~p3~0#1); 972#L138-1 assume !(0 != main_~p4~0#1); 969#L143-1 assume !(0 != main_~p5~0#1); 965#L148-1 assume !(0 != main_~p6~0#1); 961#L153-1 assume !(0 != main_~p7~0#1); 957#L158-1 assume !(0 != main_~p8~0#1); 953#L163-1 assume !(0 != main_~p9~0#1); 949#L168-1 assume !(0 != main_~p10~0#1); 944#L173-1 assume !(0 != main_~p11~0#1); 941#L178-1 assume !(0 != main_~p12~0#1); 832#L183-1 [2021-12-15 17:06:58,234 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,234 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times [2021-12-15 17:06:58,234 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,234 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [33906609] [2021-12-15 17:06:58,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,234 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,240 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,244 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,244 INFO L85 PathProgramCache]: Analyzing trace with hash 1959017738, now seen corresponding path program 1 times [2021-12-15 17:06:58,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345208066] [2021-12-15 17:06:58,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,245 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,283 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,284 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345208066] [2021-12-15 17:06:58,284 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345208066] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,284 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,284 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,284 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1871383101] [2021-12-15 17:06:58,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,284 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,285 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,285 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,285 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) [2021-12-15 17:06:58,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,309 INFO L93 Difference]: Finished difference Result 578 states and 898 transitions. [2021-12-15 17:06:58,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,310 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 578 states and 898 transitions. [2021-12-15 17:06:58,313 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2021-12-15 17:06:58,316 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 578 states to 578 states and 898 transitions. [2021-12-15 17:06:58,316 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 578 [2021-12-15 17:06:58,317 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 578 [2021-12-15 17:06:58,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 578 states and 898 transitions. [2021-12-15 17:06:58,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,319 INFO L681 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2021-12-15 17:06:58,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 578 states and 898 transitions. [2021-12-15 17:06:58,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 578 to 578. [2021-12-15 17:06:58,334 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) [2021-12-15 17:06:58,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 578 states to 578 states and 898 transitions. [2021-12-15 17:06:58,337 INFO L704 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2021-12-15 17:06:58,337 INFO L587 BuchiCegarLoop]: Abstraction has 578 states and 898 transitions. [2021-12-15 17:06:58,337 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2021-12-15 17:06:58,337 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 578 states and 898 transitions. [2021-12-15 17:06:58,339 INFO L131 ngComponentsAnalysis]: Automaton has 16 accepting balls. 576 [2021-12-15 17:06:58,339 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,339 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,339 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,340 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:58,340 INFO L791 eck$LassoCheckResult]: Stem: 1741#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 1709#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 1710#L183-1 [2021-12-15 17:06:58,340 INFO L793 eck$LassoCheckResult]: Loop: 1710#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 1939#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 1938#L78 assume !(0 != main_~p1~0#1); 1937#L78-2 assume !(0 != main_~p2~0#1); 1928#L82-1 assume !(0 != main_~p3~0#1); 1929#L86-1 assume !(0 != main_~p4~0#1); 1910#L90-1 assume !(0 != main_~p5~0#1); 1912#L94-1 assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; 1894#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 1895#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 1878#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 1879#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 1862#L114-1 assume !(0 != main_~p11~0#1); 1863#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 1846#L122-1 assume !(0 != main_~p1~0#1); 1847#L128-1 assume !(0 != main_~p2~0#1); 1967#L133-1 assume !(0 != main_~p3~0#1); 1964#L138-1 assume !(0 != main_~p4~0#1); 1961#L143-1 assume !(0 != main_~p5~0#1); 1960#L148-1 assume !(0 != main_~p6~0#1); 1958#L153-1 assume !(0 != main_~p7~0#1); 1956#L158-1 assume !(0 != main_~p8~0#1); 1953#L163-1 assume !(0 != main_~p9~0#1); 1951#L168-1 assume !(0 != main_~p10~0#1); 1945#L173-1 assume !(0 != main_~p11~0#1); 1942#L178-1 assume !(0 != main_~p12~0#1); 1710#L183-1 [2021-12-15 17:06:58,340 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,340 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 5 times [2021-12-15 17:06:58,341 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,341 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530949465] [2021-12-15 17:06:58,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,341 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,345 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,348 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,348 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,348 INFO L85 PathProgramCache]: Analyzing trace with hash 1141369288, now seen corresponding path program 1 times [2021-12-15 17:06:58,348 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,349 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247890502] [2021-12-15 17:06:58,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,349 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,366 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247890502] [2021-12-15 17:06:58,366 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247890502] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,366 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,366 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,366 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [946605406] [2021-12-15 17:06:58,367 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,367 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,367 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,367 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,368 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) [2021-12-15 17:06:58,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,379 INFO L93 Difference]: Finished difference Result 1138 states and 1746 transitions. [2021-12-15 17:06:58,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,380 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1138 states and 1746 transitions. [2021-12-15 17:06:58,386 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2021-12-15 17:06:58,392 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1138 states to 1138 states and 1746 transitions. [2021-12-15 17:06:58,392 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1138 [2021-12-15 17:06:58,393 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1138 [2021-12-15 17:06:58,393 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1138 states and 1746 transitions. [2021-12-15 17:06:58,397 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,397 INFO L681 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2021-12-15 17:06:58,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1138 states and 1746 transitions. [2021-12-15 17:06:58,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1138 to 1138. [2021-12-15 17:06:58,420 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) [2021-12-15 17:06:58,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1138 states to 1138 states and 1746 transitions. [2021-12-15 17:06:58,424 INFO L704 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2021-12-15 17:06:58,424 INFO L587 BuchiCegarLoop]: Abstraction has 1138 states and 1746 transitions. [2021-12-15 17:06:58,424 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2021-12-15 17:06:58,425 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1138 states and 1746 transitions. [2021-12-15 17:06:58,428 INFO L131 ngComponentsAnalysis]: Automaton has 32 accepting balls. 1136 [2021-12-15 17:06:58,429 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,429 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,430 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,430 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:58,430 INFO L791 eck$LassoCheckResult]: Stem: 3463#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 3431#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 3432#L183-1 [2021-12-15 17:06:58,430 INFO L793 eck$LassoCheckResult]: Loop: 3432#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 3657#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 3654#L78 assume !(0 != main_~p1~0#1); 3651#L78-2 assume !(0 != main_~p2~0#1); 3644#L82-1 assume !(0 != main_~p3~0#1); 3645#L86-1 assume !(0 != main_~p4~0#1); 3627#L90-1 assume !(0 != main_~p5~0#1); 3629#L94-1 assume !(0 != main_~p6~0#1); 3613#L98-1 assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; 3614#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 3599#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 3600#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 3585#L114-1 assume !(0 != main_~p11~0#1); 3586#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 3567#L122-1 assume !(0 != main_~p1~0#1); 3568#L128-1 assume !(0 != main_~p2~0#1); 3691#L133-1 assume !(0 != main_~p3~0#1); 3688#L138-1 assume !(0 != main_~p4~0#1); 3686#L143-1 assume !(0 != main_~p5~0#1); 3684#L148-1 assume !(0 != main_~p6~0#1); 3681#L153-1 assume !(0 != main_~p7~0#1); 3677#L158-1 assume !(0 != main_~p8~0#1); 3673#L163-1 assume !(0 != main_~p9~0#1); 3669#L168-1 assume !(0 != main_~p10~0#1); 3664#L173-1 assume !(0 != main_~p11~0#1); 3661#L178-1 assume !(0 != main_~p12~0#1); 3432#L183-1 [2021-12-15 17:06:58,431 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,431 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 6 times [2021-12-15 17:06:58,431 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926184111] [2021-12-15 17:06:58,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,432 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,438 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,442 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,443 INFO L85 PathProgramCache]: Analyzing trace with hash -547574454, now seen corresponding path program 1 times [2021-12-15 17:06:58,443 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,443 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764768390] [2021-12-15 17:06:58,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,449 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,485 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764768390] [2021-12-15 17:06:58,485 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764768390] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,485 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,486 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,486 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130094089] [2021-12-15 17:06:58,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,486 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,487 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,488 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) [2021-12-15 17:06:58,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,506 INFO L93 Difference]: Finished difference Result 2242 states and 3394 transitions. [2021-12-15 17:06:58,506 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,507 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2242 states and 3394 transitions. [2021-12-15 17:06:58,537 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2021-12-15 17:06:58,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2242 states to 2242 states and 3394 transitions. [2021-12-15 17:06:58,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2242 [2021-12-15 17:06:58,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2242 [2021-12-15 17:06:58,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2242 states and 3394 transitions. [2021-12-15 17:06:58,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,549 INFO L681 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2021-12-15 17:06:58,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2242 states and 3394 transitions. [2021-12-15 17:06:58,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2242 to 2242. [2021-12-15 17:06:58,578 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) [2021-12-15 17:06:58,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2242 states to 2242 states and 3394 transitions. [2021-12-15 17:06:58,584 INFO L704 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2021-12-15 17:06:58,586 INFO L587 BuchiCegarLoop]: Abstraction has 2242 states and 3394 transitions. [2021-12-15 17:06:58,586 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2021-12-15 17:06:58,587 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2242 states and 3394 transitions. [2021-12-15 17:06:58,596 INFO L131 ngComponentsAnalysis]: Automaton has 64 accepting balls. 2240 [2021-12-15 17:06:58,596 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,597 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,598 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,598 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:58,598 INFO L791 eck$LassoCheckResult]: Stem: 6848#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 6817#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 6818#L183-1 [2021-12-15 17:06:58,598 INFO L793 eck$LassoCheckResult]: Loop: 6818#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 7040#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 7037#L78 assume !(0 != main_~p1~0#1); 7034#L78-2 assume !(0 != main_~p2~0#1); 7026#L82-1 assume !(0 != main_~p3~0#1); 7027#L86-1 assume !(0 != main_~p4~0#1); 7010#L90-1 assume !(0 != main_~p5~0#1); 7011#L94-1 assume !(0 != main_~p6~0#1); 6994#L98-1 assume !(0 != main_~p7~0#1); 6996#L102-1 assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; 6982#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 6983#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 6970#L114-1 assume !(0 != main_~p11~0#1); 6971#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 6953#L122-1 assume !(0 != main_~p1~0#1); 6954#L128-1 assume !(0 != main_~p2~0#1); 7073#L133-1 assume !(0 != main_~p3~0#1); 7070#L138-1 assume !(0 != main_~p4~0#1); 7068#L143-1 assume !(0 != main_~p5~0#1); 7066#L148-1 assume !(0 != main_~p6~0#1); 7064#L153-1 assume !(0 != main_~p7~0#1); 7061#L158-1 assume !(0 != main_~p8~0#1); 7057#L163-1 assume !(0 != main_~p9~0#1); 7053#L168-1 assume !(0 != main_~p10~0#1); 7048#L173-1 assume !(0 != main_~p11~0#1); 7045#L178-1 assume !(0 != main_~p12~0#1); 6818#L183-1 [2021-12-15 17:06:58,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,600 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 7 times [2021-12-15 17:06:58,600 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388527279] [2021-12-15 17:06:58,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,601 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,605 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,614 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1753248136, now seen corresponding path program 1 times [2021-12-15 17:06:58,615 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,615 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305581078] [2021-12-15 17:06:58,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,615 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,646 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,647 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305581078] [2021-12-15 17:06:58,647 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305581078] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,647 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,647 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,647 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1168927117] [2021-12-15 17:06:58,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,648 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,648 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,649 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) [2021-12-15 17:06:58,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,676 INFO L93 Difference]: Finished difference Result 4418 states and 6594 transitions. [2021-12-15 17:06:58,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4418 states and 6594 transitions. [2021-12-15 17:06:58,739 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2021-12-15 17:06:58,757 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4418 states to 4418 states and 6594 transitions. [2021-12-15 17:06:58,757 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4418 [2021-12-15 17:06:58,759 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4418 [2021-12-15 17:06:58,759 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4418 states and 6594 transitions. [2021-12-15 17:06:58,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:58,764 INFO L681 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2021-12-15 17:06:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4418 states and 6594 transitions. [2021-12-15 17:06:58,816 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4418 to 4418. [2021-12-15 17:06:58,823 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) [2021-12-15 17:06:58,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4418 states to 4418 states and 6594 transitions. [2021-12-15 17:06:58,831 INFO L704 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2021-12-15 17:06:58,831 INFO L587 BuchiCegarLoop]: Abstraction has 4418 states and 6594 transitions. [2021-12-15 17:06:58,831 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2021-12-15 17:06:58,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4418 states and 6594 transitions. [2021-12-15 17:06:58,847 INFO L131 ngComponentsAnalysis]: Automaton has 128 accepting balls. 4416 [2021-12-15 17:06:58,847 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:58,847 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:58,847 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:58,847 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:58,865 INFO L791 eck$LassoCheckResult]: Stem: 13515#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 13482#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 13483#L183-1 [2021-12-15 17:06:58,865 INFO L793 eck$LassoCheckResult]: Loop: 13483#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 13834#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 13830#L78 assume !(0 != main_~p1~0#1); 13827#L78-2 assume !(0 != main_~p2~0#1); 13712#L82-1 assume !(0 != main_~p3~0#1); 13713#L86-1 assume !(0 != main_~p4~0#1); 13693#L90-1 assume !(0 != main_~p5~0#1); 13694#L94-1 assume !(0 != main_~p6~0#1); 13674#L98-1 assume !(0 != main_~p7~0#1); 13676#L102-1 assume !(0 != main_~p8~0#1); 13653#L106-1 assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; 13654#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 13637#L114-1 assume !(0 != main_~p11~0#1); 13638#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 13618#L122-1 assume !(0 != main_~p1~0#1); 13619#L128-1 assume !(0 != main_~p2~0#1); 13867#L133-1 assume !(0 != main_~p3~0#1); 13862#L138-1 assume !(0 != main_~p4~0#1); 13858#L143-1 assume !(0 != main_~p5~0#1); 13824#L148-1 assume !(0 != main_~p6~0#1); 13826#L153-1 assume !(0 != main_~p7~0#1); 13853#L158-1 assume !(0 != main_~p8~0#1); 13850#L163-1 assume !(0 != main_~p9~0#1); 13846#L168-1 assume !(0 != main_~p10~0#1); 13841#L173-1 assume !(0 != main_~p11~0#1); 13838#L178-1 assume !(0 != main_~p12~0#1); 13483#L183-1 [2021-12-15 17:06:58,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,866 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 8 times [2021-12-15 17:06:58,866 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,866 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [753403018] [2021-12-15 17:06:58,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,866 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,869 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:58,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:58,871 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:58,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:58,871 INFO L85 PathProgramCache]: Analyzing trace with hash 164900234, now seen corresponding path program 1 times [2021-12-15 17:06:58,871 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:58,872 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469600818] [2021-12-15 17:06:58,872 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:58,872 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:58,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:58,883 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:58,884 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:58,884 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469600818] [2021-12-15 17:06:58,884 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469600818] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:58,884 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:58,884 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:58,884 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796749888] [2021-12-15 17:06:58,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:58,884 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:58,885 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:58,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:58,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:58,885 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) [2021-12-15 17:06:58,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:58,918 INFO L93 Difference]: Finished difference Result 8706 states and 12802 transitions. [2021-12-15 17:06:58,918 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:58,920 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 8706 states and 12802 transitions. [2021-12-15 17:06:58,956 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2021-12-15 17:06:59,028 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 8706 states to 8706 states and 12802 transitions. [2021-12-15 17:06:59,028 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8706 [2021-12-15 17:06:59,032 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 8706 [2021-12-15 17:06:59,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8706 states and 12802 transitions. [2021-12-15 17:06:59,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:59,039 INFO L681 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2021-12-15 17:06:59,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8706 states and 12802 transitions. [2021-12-15 17:06:59,138 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8706 to 8706. [2021-12-15 17:06:59,151 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) [2021-12-15 17:06:59,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8706 states to 8706 states and 12802 transitions. [2021-12-15 17:06:59,166 INFO L704 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2021-12-15 17:06:59,166 INFO L587 BuchiCegarLoop]: Abstraction has 8706 states and 12802 transitions. [2021-12-15 17:06:59,167 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2021-12-15 17:06:59,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 8706 states and 12802 transitions. [2021-12-15 17:06:59,212 INFO L131 ngComponentsAnalysis]: Automaton has 256 accepting balls. 8704 [2021-12-15 17:06:59,212 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,212 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,214 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,214 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:59,215 INFO L791 eck$LassoCheckResult]: Stem: 26646#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 26612#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 26613#L183-1 [2021-12-15 17:06:59,215 INFO L793 eck$LassoCheckResult]: Loop: 26613#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 27025#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 27021#L78 assume !(0 != main_~p1~0#1); 27018#L78-2 assume !(0 != main_~p2~0#1); 27019#L82-1 assume !(0 != main_~p3~0#1); 27063#L86-1 assume !(0 != main_~p4~0#1); 26838#L90-1 assume !(0 != main_~p5~0#1); 26839#L94-1 assume !(0 != main_~p6~0#1); 26819#L98-1 assume !(0 != main_~p7~0#1); 26821#L102-1 assume !(0 != main_~p8~0#1); 26795#L106-1 assume !(0 != main_~p9~0#1); 26797#L110-1 assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; 26778#L114-1 assume !(0 != main_~p11~0#1); 26779#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 26759#L122-1 assume !(0 != main_~p1~0#1); 26760#L128-1 assume !(0 != main_~p2~0#1); 27053#L133-1 assume !(0 != main_~p3~0#1); 26987#L138-1 assume !(0 != main_~p4~0#1); 26988#L143-1 assume !(0 != main_~p5~0#1); 27049#L148-1 assume !(0 != main_~p6~0#1); 27047#L153-1 assume !(0 != main_~p7~0#1); 27044#L158-1 assume !(0 != main_~p8~0#1); 27040#L163-1 assume !(0 != main_~p9~0#1); 27037#L168-1 assume !(0 != main_~p10~0#1); 27032#L173-1 assume !(0 != main_~p11~0#1); 27029#L178-1 assume !(0 != main_~p12~0#1); 26613#L183-1 [2021-12-15 17:06:59,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,216 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 9 times [2021-12-15 17:06:59,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194558543] [2021-12-15 17:06:59,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,217 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,237 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,246 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,247 INFO L85 PathProgramCache]: Analyzing trace with hash -856168120, now seen corresponding path program 1 times [2021-12-15 17:06:59,247 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,247 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1297166993] [2021-12-15 17:06:59,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,248 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:59,297 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:59,298 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:59,298 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1297166993] [2021-12-15 17:06:59,298 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1297166993] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:59,299 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:59,299 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-12-15 17:06:59,299 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50536690] [2021-12-15 17:06:59,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:59,300 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:59,300 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:59,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:59,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:59,301 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) [2021-12-15 17:06:59,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:06:59,356 INFO L93 Difference]: Finished difference Result 17154 states and 24834 transitions. [2021-12-15 17:06:59,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:06:59,357 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 17154 states and 24834 transitions. [2021-12-15 17:06:59,501 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2021-12-15 17:06:59,581 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 17154 states to 17154 states and 24834 transitions. [2021-12-15 17:06:59,581 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17154 [2021-12-15 17:06:59,591 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17154 [2021-12-15 17:06:59,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17154 states and 24834 transitions. [2021-12-15 17:06:59,607 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:06:59,607 INFO L681 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2021-12-15 17:06:59,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17154 states and 24834 transitions. [2021-12-15 17:06:59,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17154 to 17154. [2021-12-15 17:06:59,798 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) [2021-12-15 17:06:59,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17154 states to 17154 states and 24834 transitions. [2021-12-15 17:06:59,831 INFO L704 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2021-12-15 17:06:59,831 INFO L587 BuchiCegarLoop]: Abstraction has 17154 states and 24834 transitions. [2021-12-15 17:06:59,831 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2021-12-15 17:06:59,831 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 17154 states and 24834 transitions. [2021-12-15 17:06:59,944 INFO L131 ngComponentsAnalysis]: Automaton has 512 accepting balls. 17152 [2021-12-15 17:06:59,944 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:06:59,944 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:06:59,944 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:06:59,944 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:06:59,944 INFO L791 eck$LassoCheckResult]: Stem: 52512#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 52479#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 52480#L183-1 [2021-12-15 17:06:59,945 INFO L793 eck$LassoCheckResult]: Loop: 52480#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 53075#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 53070#L78 assume !(0 != main_~p1~0#1); 53071#L78-2 assume !(0 != main_~p2~0#1); 53058#L82-1 assume !(0 != main_~p3~0#1); 53059#L86-1 assume !(0 != main_~p4~0#1); 53047#L90-1 assume !(0 != main_~p5~0#1); 53049#L94-1 assume !(0 != main_~p6~0#1); 53158#L98-1 assume !(0 != main_~p7~0#1); 53150#L102-1 assume !(0 != main_~p8~0#1); 53145#L106-1 assume !(0 != main_~p9~0#1); 53142#L110-1 assume !(0 != main_~p10~0#1); 53137#L114-1 assume !(0 != main_~p11~0#1); 53132#L118-1 assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; 53127#L122-1 assume !(0 != main_~p1~0#1); 53121#L128-1 assume !(0 != main_~p2~0#1); 53120#L133-1 assume !(0 != main_~p3~0#1); 53116#L138-1 assume !(0 != main_~p4~0#1); 53113#L143-1 assume !(0 != main_~p5~0#1); 53109#L148-1 assume !(0 != main_~p6~0#1); 53105#L153-1 assume !(0 != main_~p7~0#1); 53101#L158-1 assume !(0 != main_~p8~0#1); 53097#L163-1 assume !(0 != main_~p9~0#1); 53089#L168-1 assume !(0 != main_~p10~0#1); 53087#L173-1 assume !(0 != main_~p11~0#1); 53086#L178-1 assume !(0 != main_~p12~0#1); 52480#L183-1 [2021-12-15 17:06:59,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,945 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 10 times [2021-12-15 17:06:59,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,945 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992568358] [2021-12-15 17:06:59,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,945 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,948 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:06:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:06:59,950 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:06:59,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:06:59,951 INFO L85 PathProgramCache]: Analyzing trace with hash -2136031798, now seen corresponding path program 1 times [2021-12-15 17:06:59,951 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:06:59,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [270871795] [2021-12-15 17:06:59,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:06:59,951 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:06:59,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-12-15 17:06:59,961 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-12-15 17:06:59,962 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2021-12-15 17:06:59,962 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [270871795] [2021-12-15 17:06:59,963 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [270871795] provided 1 perfect and 0 imperfect interpolant sequences [2021-12-15 17:06:59,963 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2021-12-15 17:06:59,963 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-12-15 17:06:59,963 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800112424] [2021-12-15 17:06:59,963 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2021-12-15 17:06:59,964 INFO L808 eck$LassoCheckResult]: loop already infeasible [2021-12-15 17:06:59,964 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2021-12-15 17:06:59,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-12-15 17:06:59,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-12-15 17:06:59,966 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) [2021-12-15 17:07:00,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-12-15 17:07:00,063 INFO L93 Difference]: Finished difference Result 33794 states and 48130 transitions. [2021-12-15 17:07:00,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-12-15 17:07:00,064 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33794 states and 48130 transitions. [2021-12-15 17:07:00,213 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2021-12-15 17:07:00,420 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33794 states to 33794 states and 48130 transitions. [2021-12-15 17:07:00,420 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33794 [2021-12-15 17:07:00,449 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 33794 [2021-12-15 17:07:00,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 33794 states and 48130 transitions. [2021-12-15 17:07:00,472 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2021-12-15 17:07:00,473 INFO L681 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2021-12-15 17:07:00,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33794 states and 48130 transitions. [2021-12-15 17:07:00,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33794 to 33794. [2021-12-15 17:07:00,890 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) [2021-12-15 17:07:00,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33794 states to 33794 states and 48130 transitions. [2021-12-15 17:07:00,952 INFO L704 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2021-12-15 17:07:00,952 INFO L587 BuchiCegarLoop]: Abstraction has 33794 states and 48130 transitions. [2021-12-15 17:07:00,952 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2021-12-15 17:07:00,952 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 33794 states and 48130 transitions. [2021-12-15 17:07:01,056 INFO L131 ngComponentsAnalysis]: Automaton has 1024 accepting balls. 33792 [2021-12-15 17:07:01,056 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2021-12-15 17:07:01,056 INFO L119 BuchiIsEmpty]: Starting construction of run [2021-12-15 17:07:01,057 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2021-12-15 17:07:01,057 INFO L843 BuchiCegarLoop]: 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] [2021-12-15 17:07:01,057 INFO L791 eck$LassoCheckResult]: Stem: 103466#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); 103432#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~cond~0#1;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;havoc main_~cond~0#1; 103433#L183-1 [2021-12-15 17:07:01,057 INFO L793 eck$LassoCheckResult]: Loop: 103433#L183-1 assume !false;main_~cond~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1; 103596#L49 assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0; 103594#L78 assume !(0 != main_~p1~0#1); 103590#L78-2 assume !(0 != main_~p2~0#1); 103588#L82-1 assume !(0 != main_~p3~0#1); 103584#L86-1 assume !(0 != main_~p4~0#1); 103580#L90-1 assume !(0 != main_~p5~0#1); 103576#L94-1 assume !(0 != main_~p6~0#1); 103572#L98-1 assume !(0 != main_~p7~0#1); 103568#L102-1 assume !(0 != main_~p8~0#1); 103564#L106-1 assume !(0 != main_~p9~0#1); 103560#L110-1 assume !(0 != main_~p10~0#1); 103558#L114-1 assume !(0 != main_~p11~0#1); 103554#L118-1 assume !(0 != main_~p12~0#1); 103551#L122-1 assume !(0 != main_~p1~0#1); 103552#L128-1 assume !(0 != main_~p2~0#1); 103636#L133-1 assume !(0 != main_~p3~0#1); 103631#L138-1 assume !(0 != main_~p4~0#1); 103627#L143-1 assume !(0 != main_~p5~0#1); 103623#L148-1 assume !(0 != main_~p6~0#1); 103619#L153-1 assume !(0 != main_~p7~0#1); 103615#L158-1 assume !(0 != main_~p8~0#1); 103611#L163-1 assume !(0 != main_~p9~0#1); 103607#L168-1 assume !(0 != main_~p10~0#1); 103603#L173-1 assume !(0 != main_~p11~0#1); 103599#L178-1 assume !(0 != main_~p12~0#1); 103433#L183-1 [2021-12-15 17:07:01,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,057 INFO L85 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 11 times [2021-12-15 17:07:01,058 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,058 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447318049] [2021-12-15 17:07:01,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,058 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,061 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,064 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,064 INFO L85 PathProgramCache]: Analyzing trace with hash 1572129484, now seen corresponding path program 1 times [2021-12-15 17:07:01,064 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [469053524] [2021-12-15 17:07:01,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,065 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,067 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,076 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-12-15 17:07:01,077 INFO L85 PathProgramCache]: Analyzing trace with hash -1068122098, now seen corresponding path program 1 times [2021-12-15 17:07:01,077 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2021-12-15 17:07:01,077 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081304778] [2021-12-15 17:07:01,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-12-15 17:07:01,077 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-12-15 17:07:01,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,081 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-12-15 17:07:01,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-12-15 17:07:01,086 INFO L133 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2021-12-15 17:07:01,353 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer has thrown an exception: java.lang.UnsupportedOperationException: Set is immutable at de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.UnmodifiableTransFormula.removeSuperfluousVars(UnmodifiableTransFormula.java:212) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.finishConstruction(TransFormulaBuilder.java:273) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaBuilder.getTrivialTransFormula(TransFormulaBuilder.java:285) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.synthesize(LassoCheck.java:548) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkLoopTermination(LassoCheck.java:944) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:855) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:252) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:457) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:142) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:397) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2021-12-15 17:07:01,356 INFO L158 Benchmark]: Toolchain (without parser) took 4328.28ms. Allocated memory was 81.8MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 51.9MB in the beginning and 1.2GB in the end (delta: -1.2GB). Peak memory consumption was 328.5MB. Max. memory is 16.1GB. [2021-12-15 17:07:01,357 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 81.8MB. Free memory was 38.6MB in the beginning and 38.6MB in the end (delta: 34.2kB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:01,357 INFO L158 Benchmark]: CACSL2BoogieTranslator took 213.59ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 51.7MB in the beginning and 86.9MB in the end (delta: -35.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2021-12-15 17:07:01,357 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.77ms. Allocated memory is still 111.1MB. Free memory was 86.9MB in the beginning and 85.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. [2021-12-15 17:07:01,358 INFO L158 Benchmark]: Boogie Preprocessor took 23.48ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2021-12-15 17:07:01,358 INFO L158 Benchmark]: RCFGBuilder took 254.74ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 72.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2021-12-15 17:07:01,358 INFO L158 Benchmark]: BuchiAutomizer took 3800.84ms. Allocated memory was 111.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 72.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 320.8MB. Max. memory is 16.1GB. [2021-12-15 17:07:01,360 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 81.8MB. Free memory was 38.6MB in the beginning and 38.6MB in the end (delta: 34.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 213.59ms. Allocated memory was 81.8MB in the beginning and 111.1MB in the end (delta: 29.4MB). Free memory was 51.7MB in the beginning and 86.9MB in the end (delta: -35.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.77ms. Allocated memory is still 111.1MB. Free memory was 86.9MB in the beginning and 85.3MB in the end (delta: 1.6MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 23.48ms. Allocated memory is still 111.1MB. Free memory was 85.3MB in the beginning and 83.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 254.74ms. Allocated memory is still 111.1MB. Free memory was 83.9MB in the beginning and 72.2MB in the end (delta: 11.7MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 3800.84ms. Allocated memory was 111.1MB in the beginning and 1.5GB in the end (delta: 1.4GB). Free memory was 72.2MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 320.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: UnsupportedOperationException: Set is immutable: de.uni_freiburg.informatik.ultimate.util.datastructures.ImmutableSet.retainAll(ImmutableSet.java:338) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2021-12-15 17:07:01,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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 Using bit-precise analysis No suitable file found in config dir /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config using search string *Termination*32bit*_Bitvector*.epf No suitable settings file found using Termination*32bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: UnsupportedOperationException: Set is immutable