./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i --full-output --architecture 32bit


--------------------------------------------------------------------------------


Checking for termination
Using default analysis
Version b2eff8ba
Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg --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 ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................
Execution finished normally
Writing output log to file Ultimate.log
Writing human readable error path to file UltimateCounterExample.errorpath
Result:
FALSE(TERM)
--- Real Ultimate output ---
This is Ultimate 0.2.1-dev-b2eff8b
[2021-10-28 09:04:36,323 INFO  L177        SettingsManager]: Resetting all preferences to default values...
[2021-10-28 09:04:36,326 INFO  L181        SettingsManager]: Resetting UltimateCore preferences to default values
[2021-10-28 09:04:36,394 INFO  L184        SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring...
[2021-10-28 09:04:36,394 INFO  L181        SettingsManager]: Resetting Boogie Preprocessor preferences to default values
[2021-10-28 09:04:36,401 INFO  L181        SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values
[2021-10-28 09:04:36,403 INFO  L181        SettingsManager]: Resetting Abstract Interpretation preferences to default values
[2021-10-28 09:04:36,408 INFO  L181        SettingsManager]: Resetting LassoRanker preferences to default values
[2021-10-28 09:04:36,413 INFO  L181        SettingsManager]: Resetting Reaching Definitions preferences to default values
[2021-10-28 09:04:36,424 INFO  L181        SettingsManager]: Resetting SyntaxChecker preferences to default values
[2021-10-28 09:04:36,425 INFO  L181        SettingsManager]: Resetting Sifa preferences to default values
[2021-10-28 09:04:36,428 INFO  L184        SettingsManager]: Büchi Program Product provides no preferences, ignoring...
[2021-10-28 09:04:36,429 INFO  L181        SettingsManager]: Resetting LTL2Aut preferences to default values
[2021-10-28 09:04:36,433 INFO  L181        SettingsManager]: Resetting PEA to Boogie preferences to default values
[2021-10-28 09:04:36,436 INFO  L181        SettingsManager]: Resetting BlockEncodingV2 preferences to default values
[2021-10-28 09:04:36,445 INFO  L181        SettingsManager]: Resetting ChcToBoogie preferences to default values
[2021-10-28 09:04:36,449 INFO  L181        SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values
[2021-10-28 09:04:36,451 INFO  L181        SettingsManager]: Resetting BuchiAutomizer preferences to default values
[2021-10-28 09:04:36,454 INFO  L181        SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values
[2021-10-28 09:04:36,462 INFO  L181        SettingsManager]: Resetting CodeCheck preferences to default values
[2021-10-28 09:04:36,466 INFO  L181        SettingsManager]: Resetting InvariantSynthesis preferences to default values
[2021-10-28 09:04:36,468 INFO  L181        SettingsManager]: Resetting RCFGBuilder preferences to default values
[2021-10-28 09:04:36,472 INFO  L181        SettingsManager]: Resetting Referee preferences to default values
[2021-10-28 09:04:36,474 INFO  L181        SettingsManager]: Resetting TraceAbstraction preferences to default values
[2021-10-28 09:04:36,482 INFO  L184        SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring...
[2021-10-28 09:04:36,483 INFO  L184        SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring...
[2021-10-28 09:04:36,484 INFO  L181        SettingsManager]: Resetting TreeAutomizer preferences to default values
[2021-10-28 09:04:36,487 INFO  L181        SettingsManager]: Resetting IcfgToChc preferences to default values
[2021-10-28 09:04:36,487 INFO  L181        SettingsManager]: Resetting IcfgTransformer preferences to default values
[2021-10-28 09:04:36,489 INFO  L184        SettingsManager]: ReqToTest provides no preferences, ignoring...
[2021-10-28 09:04:36,490 INFO  L181        SettingsManager]: Resetting Boogie Printer preferences to default values
[2021-10-28 09:04:36,491 INFO  L181        SettingsManager]: Resetting ChcSmtPrinter preferences to default values
[2021-10-28 09:04:36,494 INFO  L181        SettingsManager]: Resetting ReqPrinter preferences to default values
[2021-10-28 09:04:36,496 INFO  L181        SettingsManager]: Resetting Witness Printer preferences to default values
[2021-10-28 09:04:36,498 INFO  L184        SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring...
[2021-10-28 09:04:36,498 INFO  L181        SettingsManager]: Resetting CDTParser preferences to default values
[2021-10-28 09:04:36,499 INFO  L184        SettingsManager]: AutomataScriptParser provides no preferences, ignoring...
[2021-10-28 09:04:36,500 INFO  L184        SettingsManager]: ReqParser provides no preferences, ignoring...
[2021-10-28 09:04:36,500 INFO  L181        SettingsManager]: Resetting SmtParser preferences to default values
[2021-10-28 09:04:36,501 INFO  L181        SettingsManager]: Resetting Witness Parser preferences to default values
[2021-10-28 09:04:36,502 INFO  L188        SettingsManager]: Finished resetting all preferences to default values...
[2021-10-28 09:04:36,503 INFO  L101        SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/config/svcomp-Termination-32bit-Automizer_Default.epf
[2021-10-28 09:04:36,566 INFO  L113        SettingsManager]: Loading preferences was successful
[2021-10-28 09:04:36,569 INFO  L115        SettingsManager]: Preferences different from defaults after loading the file:
[2021-10-28 09:04:36,570 INFO  L136        SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2021-10-28 09:04:36,570 INFO  L138        SettingsManager]:  * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2021-10-28 09:04:36,572 INFO  L136        SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2021-10-28 09:04:36,572 INFO  L138        SettingsManager]:  * Create parallel compositions if possible=false
[2021-10-28 09:04:36,573 INFO  L138        SettingsManager]:  * Use SBE=true
[2021-10-28 09:04:36,573 INFO  L136        SettingsManager]: Preferences of BuchiAutomizer differ from their defaults:
[2021-10-28 09:04:36,573 INFO  L138        SettingsManager]:  * NCSB implementation=INTSET_LAZY3
[2021-10-28 09:04:36,573 INFO  L138        SettingsManager]:  * Use old map elimination=false
[2021-10-28 09:04:36,575 INFO  L138        SettingsManager]:  * Use external solver (rank synthesis)=false
[2021-10-28 09:04:36,575 INFO  L138        SettingsManager]:  * Use only trivial implications for array writes=true
[2021-10-28 09:04:36,576 INFO  L138        SettingsManager]:  * Rank analysis=LINEAR_WITH_GUESSES
[2021-10-28 09:04:36,576 INFO  L136        SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2021-10-28 09:04:36,576 INFO  L138        SettingsManager]:  * sizeof long=4
[2021-10-28 09:04:36,576 INFO  L138        SettingsManager]:  * Check unreachability of error function in SV-COMP mode=false
[2021-10-28 09:04:36,577 INFO  L138        SettingsManager]:  * Overapproximate operations on floating types=true
[2021-10-28 09:04:36,577 INFO  L138        SettingsManager]:  * sizeof POINTER=4
[2021-10-28 09:04:36,577 INFO  L138        SettingsManager]:  * Check division by zero=IGNORE
[2021-10-28 09:04:36,577 INFO  L138        SettingsManager]:  * Pointer to allocated memory at dereference=ASSUME
[2021-10-28 09:04:36,578 INFO  L138        SettingsManager]:  * If two pointers are subtracted or compared they have the same base address=ASSUME
[2021-10-28 09:04:36,578 INFO  L138        SettingsManager]:  * Check array bounds for arrays that are off heap=ASSUME
[2021-10-28 09:04:36,578 INFO  L138        SettingsManager]:  * sizeof long double=12
[2021-10-28 09:04:36,579 INFO  L138        SettingsManager]:  * Check if freed pointer was valid=false
[2021-10-28 09:04:36,579 INFO  L138        SettingsManager]:  * Assume nondeterminstic values are in range=false
[2021-10-28 09:04:36,579 INFO  L138        SettingsManager]:  * Use constant arrays=true
[2021-10-28 09:04:36,581 INFO  L138        SettingsManager]:  * Pointer base address is valid at dereference=ASSUME
[2021-10-28 09:04:36,581 INFO  L136        SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2021-10-28 09:04:36,582 INFO  L138        SettingsManager]:  * Size of a code block=SequenceOfStatements
[2021-10-28 09:04:36,582 INFO  L136        SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2021-10-28 09:04:36,582 INFO  L138        SettingsManager]:  * Trace refinement strategy=CAMEL
[2021-10-28 09:04:36,583 INFO  L138        SettingsManager]:  * Trace refinement exception blacklist=NONE
[2021-10-28 09:04:36,584 INFO  L136        SettingsManager]: Preferences of IcfgTransformer differ from their defaults:
[2021-10-28 09:04:36,585 INFO  L138        SettingsManager]:  * TransformationType=MODULO_NEIGHBOR
WARNING: An illegal reflective access operation has occurred
WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int)
WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1
WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations
WARNING: All illegal access operations will be denied in a future release
Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg
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 -> ba983053090b7e7410066c63fe0cfe9ad27960a7dc19d54045684ba21359c88d
[2021-10-28 09:04:36,972 INFO  L75    nceAwareModelManager]: Repository-Root is: /tmp
[2021-10-28 09:04:37,001 INFO  L261   ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2021-10-28 09:04:37,004 INFO  L217   ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2021-10-28 09:04:37,006 INFO  L271        PluginConnector]: Initializing CDTParser...
[2021-10-28 09:04:37,007 INFO  L275        PluginConnector]: CDTParser initialized
[2021-10-28 09:04:37,009 INFO  L432   ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/../../sv-benchmarks/c/memsafety-ext/tree_cnstr.i
[2021-10-28 09:04:37,116 INFO  L220              CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/data/df5c4ce65/50a5c598e0044b84954a35f73957d714/FLAG8d0998304
[2021-10-28 09:04:37,784 INFO  L306              CDTParser]: Found 1 translation units.
[2021-10-28 09:04:37,785 INFO  L160              CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/sv-benchmarks/c/memsafety-ext/tree_cnstr.i
[2021-10-28 09:04:37,799 INFO  L349              CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/data/df5c4ce65/50a5c598e0044b84954a35f73957d714/FLAG8d0998304
[2021-10-28 09:04:38,040 INFO  L357              CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/data/df5c4ce65/50a5c598e0044b84954a35f73957d714
[2021-10-28 09:04:38,043 INFO  L299   ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2021-10-28 09:04:38,045 INFO  L131        ToolchainWalker]: Walking toolchain with 6 elements.
[2021-10-28 09:04:38,048 INFO  L113        PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2021-10-28 09:04:38,049 INFO  L271        PluginConnector]: Initializing CACSL2BoogieTranslator...
[2021-10-28 09:04:38,053 INFO  L275        PluginConnector]: CACSL2BoogieTranslator initialized
[2021-10-28 09:04:38,055 INFO  L185        PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,056 INFO  L205        PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3e0263e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38, skipping insertion in model container
[2021-10-28 09:04:38,057 INFO  L185        PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,066 INFO  L145         MainTranslator]: Starting translation in SV-COMP mode 
[2021-10-28 09:04:38,141 INFO  L178         MainTranslator]: Built tables and reachable declarations
[2021-10-28 09:04:38,594 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-28 09:04:38,606 INFO  L203         MainTranslator]: Completed pre-run
[2021-10-28 09:04:38,652 INFO  L206          PostProcessor]: Analyzing one entry point: main
[2021-10-28 09:04:38,687 INFO  L208         MainTranslator]: Completed translation
[2021-10-28 09:04:38,688 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38 WrapperNode
[2021-10-28 09:04:38,688 INFO  L132        PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2021-10-28 09:04:38,690 INFO  L113        PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2021-10-28 09:04:38,690 INFO  L271        PluginConnector]: Initializing Boogie Procedure Inliner...
[2021-10-28 09:04:38,690 INFO  L275        PluginConnector]: Boogie Procedure Inliner initialized
[2021-10-28 09:04:38,700 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,719 INFO  L185        PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,752 INFO  L132        PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2021-10-28 09:04:38,753 INFO  L113        PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2021-10-28 09:04:38,754 INFO  L271        PluginConnector]: Initializing Boogie Preprocessor...
[2021-10-28 09:04:38,754 INFO  L275        PluginConnector]: Boogie Preprocessor initialized
[2021-10-28 09:04:38,765 INFO  L185        PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,765 INFO  L185        PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,770 INFO  L185        PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,771 INFO  L185        PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,783 INFO  L185        PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,789 INFO  L185        PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,791 INFO  L185        PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,795 INFO  L132        PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2021-10-28 09:04:38,796 INFO  L113        PluginConnector]: ------------------------RCFGBuilder----------------------------
[2021-10-28 09:04:38,797 INFO  L271        PluginConnector]: Initializing RCFGBuilder...
[2021-10-28 09:04:38,797 INFO  L275        PluginConnector]: RCFGBuilder initialized
[2021-10-28 09:04:38,806 INFO  L185        PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (1/1) ...
[2021-10-28 09:04:38,818 INFO  L170          SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000
[2021-10-28 09:04:38,831 INFO  L189       MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/z3
[2021-10-28 09:04:38,845 INFO  L229       MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null)
[2021-10-28 09:04:38,848 INFO  L327       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process
[2021-10-28 09:04:38,894 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap
[2021-10-28 09:04:38,895 INFO  L130     BoogieDeclarations]: Found specification of procedure write~$Pointer$
[2021-10-28 09:04:38,895 INFO  L130     BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack
[2021-10-28 09:04:38,895 INFO  L130     BoogieDeclarations]: Found specification of procedure read~$Pointer$
[2021-10-28 09:04:38,895 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc
[2021-10-28 09:04:38,896 INFO  L130     BoogieDeclarations]: Found specification of procedure write~init~int
[2021-10-28 09:04:38,896 INFO  L130     BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2021-10-28 09:04:38,896 INFO  L138     BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2021-10-28 09:04:39,544 INFO  L294             CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2021-10-28 09:04:39,544 INFO  L299             CfgBuilder]: Removed 8 assume(true) statements.
[2021-10-28 09:04:39,547 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:04:39 BoogieIcfgContainer
[2021-10-28 09:04:39,547 INFO  L132        PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2021-10-28 09:04:39,548 INFO  L113        PluginConnector]: ------------------------BuchiAutomizer----------------------------
[2021-10-28 09:04:39,548 INFO  L271        PluginConnector]: Initializing BuchiAutomizer...
[2021-10-28 09:04:39,554 INFO  L275        PluginConnector]: BuchiAutomizer initialized
[2021-10-28 09:04:39,555 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 09:04:39,555 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 28.10 09:04:38" (1/3) ...
[2021-10-28 09:04:39,556 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3adc067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 09:04:39, skipping insertion in model container
[2021-10-28 09:04:39,556 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 09:04:39,556 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.10 09:04:38" (2/3) ...
[2021-10-28 09:04:39,556 INFO  L205        PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@3adc067 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 28.10 09:04:39, skipping insertion in model container
[2021-10-28 09:04:39,556 INFO  L99          BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis
[2021-10-28 09:04:39,557 INFO  L185        PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:04:39" (3/3) ...
[2021-10-28 09:04:39,559 INFO  L389   chiAutomizerObserver]: Analyzing ICFG tree_cnstr.i
[2021-10-28 09:04:39,612 INFO  L359         BuchiCegarLoop]: Interprodecural is true
[2021-10-28 09:04:39,613 INFO  L360         BuchiCegarLoop]: Hoare is false
[2021-10-28 09:04:39,613 INFO  L361         BuchiCegarLoop]: Compute interpolants for ForwardPredicates
[2021-10-28 09:04:39,613 INFO  L362         BuchiCegarLoop]: Backedges is STRAIGHT_LINE
[2021-10-28 09:04:39,613 INFO  L363         BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION
[2021-10-28 09:04:39,614 INFO  L364         BuchiCegarLoop]: Difference is false
[2021-10-28 09:04:39,614 INFO  L365         BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA
[2021-10-28 09:04:39,614 INFO  L368         BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop========
[2021-10-28 09:04:39,632 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 09:04:39,655 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-28 09:04:39,656 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 09:04:39,656 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 09:04:39,663 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-28 09:04:39,664 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2021-10-28 09:04:39,664 INFO  L425         BuchiCegarLoop]: ======== Iteration 1============
[2021-10-28 09:04:39,664 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand  has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 09:04:39,667 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-28 09:04:39,668 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 09:04:39,668 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 09:04:39,668 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-28 09:04:39,669 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1]
[2021-10-28 09:04:39,677 INFO  L791   eck$LassoCheckResult]: Stem: 6#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 17#L-1true havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 13#L545-2true 
[2021-10-28 09:04:39,678 INFO  L793   eck$LassoCheckResult]: Loop: 13#L545-2true assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 15#L535-2true assume !true; 18#L534-5true call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 19#L540true assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 21#L540-2true call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 10#L545true assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 13#L545-2true 
[2021-10-28 09:04:39,685 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:39,685 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times
[2021-10-28 09:04:39,696 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:39,697 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443232050]
[2021-10-28 09:04:39,697 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:39,698 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:39,837 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:39,838 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 09:04:39,873 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:39,922 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 09:04:39,941 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:39,942 INFO  L85        PathProgramCache]: Analyzing trace with hash 1235889697, now seen corresponding path program 1 times
[2021-10-28 09:04:39,946 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:39,947 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1167454197]
[2021-10-28 09:04:39,947 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:39,948 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:39,957 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 09:04:40,072 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 09:04:40,072 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 09:04:40,074 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1167454197]
[2021-10-28 09:04:40,075 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1167454197] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 09:04:40,075 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 09:04:40,075 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2
[2021-10-28 09:04:40,076 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766921523]
[2021-10-28 09:04:40,082 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-10-28 09:04:40,083 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 09:04:40,104 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants.
[2021-10-28 09:04:40,106 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2
[2021-10-28 09:04:40,109 INFO  L87              Difference]: Start difference. First operand  has 24 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand  has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 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-10-28 09:04:40,120 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 09:04:40,120 INFO  L93              Difference]: Finished difference Result 24 states and 35 transitions.
[2021-10-28 09:04:40,121 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. 
[2021-10-28 09:04:40,123 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 35 transitions.
[2021-10-28 09:04:40,128 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-28 09:04:40,134 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 20 states and 31 transitions.
[2021-10-28 09:04:40,136 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 20
[2021-10-28 09:04:40,136 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 20
[2021-10-28 09:04:40,137 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 20 states and 31 transitions.
[2021-10-28 09:04:40,139 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 09:04:40,139 INFO  L681         BuchiCegarLoop]: Abstraction has 20 states and 31 transitions.
[2021-10-28 09:04:40,160 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 20 states and 31 transitions.
[2021-10-28 09:04:40,172 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20.
[2021-10-28 09:04:40,174 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 20 states, 20 states have (on average 1.55) internal successors, (31), 19 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 09:04:40,177 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 31 transitions.
[2021-10-28 09:04:40,178 INFO  L704         BuchiCegarLoop]: Abstraction has 20 states and 31 transitions.
[2021-10-28 09:04:40,179 INFO  L587         BuchiCegarLoop]: Abstraction has 20 states and 31 transitions.
[2021-10-28 09:04:40,179 INFO  L425         BuchiCegarLoop]: ======== Iteration 2============
[2021-10-28 09:04:40,179 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 20 states and 31 transitions.
[2021-10-28 09:04:40,182 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 17
[2021-10-28 09:04:40,183 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 09:04:40,183 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 09:04:40,183 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-28 09:04:40,183 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 09:04:40,184 INFO  L791   eck$LassoCheckResult]: Stem: 60#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 61#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 66#L545-2 
[2021-10-28 09:04:40,184 INFO  L793   eck$LassoCheckResult]: Loop: 66#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 62#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 56#L534-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 57#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 58#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 70#L540 assume (main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14;havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.allocOnHeap(8);call write~$Pointer$(main_#t~malloc15.base, main_#t~malloc15.offset, main_~n~0.base, main_~n~0.offset, 4);havoc main_#t~malloc15.base, main_#t~malloc15.offset;call main_#t~mem16.base, main_#t~mem16.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem16.base, main_#t~mem16.offset, 4);havoc main_#t~mem16.base, main_#t~mem16.offset;call main_#t~mem17.base, main_#t~mem17.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);call write~$Pointer$(0, 0, main_#t~mem17.base, 4 + main_#t~mem17.offset, 4);havoc main_#t~mem17.base, main_#t~mem17.offset; 71#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 65#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 66#L545-2 
[2021-10-28 09:04:40,187 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:40,188 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 2 times
[2021-10-28 09:04:40,188 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:40,189 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1264474778]
[2021-10-28 09:04:40,189 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:40,190 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:40,249 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:40,250 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 09:04:40,288 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:40,301 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 09:04:40,309 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:40,309 INFO  L85        PathProgramCache]: Analyzing trace with hash 2066931060, now seen corresponding path program 1 times
[2021-10-28 09:04:40,310 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:40,310 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524993322]
[2021-10-28 09:04:40,310 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:40,311 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:40,333 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 09:04:40,467 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 09:04:40,469 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 09:04:40,470 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524993322]
[2021-10-28 09:04:40,471 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1524993322] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 09:04:40,471 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 09:04:40,472 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-28 09:04:40,473 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749822478]
[2021-10-28 09:04:40,473 INFO  L808   eck$LassoCheckResult]: loop already infeasible
[2021-10-28 09:04:40,474 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 09:04:40,475 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-28 09:04:40,476 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20
[2021-10-28 09:04:40,477 INFO  L87              Difference]: Start difference. First operand 20 states and 31 transitions. cyclomatic complexity: 13 Second operand  has 5 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-28 09:04:40,702 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 09:04:40,702 INFO  L93              Difference]: Finished difference Result 27 states and 41 transitions.
[2021-10-28 09:04:40,703 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. 
[2021-10-28 09:04:40,704 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 27 states and 41 transitions.
[2021-10-28 09:04:40,705 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 23
[2021-10-28 09:04:40,708 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 27 states to 27 states and 41 transitions.
[2021-10-28 09:04:40,708 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 27
[2021-10-28 09:04:40,709 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 27
[2021-10-28 09:04:40,709 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 27 states and 41 transitions.
[2021-10-28 09:04:40,709 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 09:04:40,709 INFO  L681         BuchiCegarLoop]: Abstraction has 27 states and 41 transitions.
[2021-10-28 09:04:40,709 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 27 states and 41 transitions.
[2021-10-28 09:04:40,716 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23.
[2021-10-28 09:04:40,716 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 23 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 22 states have internal predecessors, (35), 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-10-28 09:04:40,718 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 35 transitions.
[2021-10-28 09:04:40,718 INFO  L704         BuchiCegarLoop]: Abstraction has 23 states and 35 transitions.
[2021-10-28 09:04:40,718 INFO  L587         BuchiCegarLoop]: Abstraction has 23 states and 35 transitions.
[2021-10-28 09:04:40,719 INFO  L425         BuchiCegarLoop]: ======== Iteration 3============
[2021-10-28 09:04:40,719 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 23 states and 35 transitions.
[2021-10-28 09:04:40,725 INFO  L131   ngComponentsAnalysis]: Automaton has 2 accepting balls. 20
[2021-10-28 09:04:40,726 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 09:04:40,726 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 09:04:40,727 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-28 09:04:40,728 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 09:04:40,728 INFO  L791   eck$LassoCheckResult]: Stem: 118#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 119#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 124#L545-2 
[2021-10-28 09:04:40,729 INFO  L793   eck$LassoCheckResult]: Loop: 124#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 120#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 113#L534-1 assume main_#t~short9;call main_#t~mem8.base, main_#t~mem8.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4);main_#t~short9 := main_#t~mem8.base != 0 || main_#t~mem8.offset != 0; 114#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 135#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 129#L540 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 130#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 123#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 124#L545-2 
[2021-10-28 09:04:40,731 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:40,731 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 3 times
[2021-10-28 09:04:40,731 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:40,732 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1241750081]
[2021-10-28 09:04:40,732 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:40,732 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:40,759 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:40,759 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 09:04:40,784 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:40,790 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 09:04:40,795 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:40,796 INFO  L85        PathProgramCache]: Analyzing trace with hash 2066932982, now seen corresponding path program 1 times
[2021-10-28 09:04:40,796 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:40,797 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1578551087]
[2021-10-28 09:04:40,797 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:40,797 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:40,821 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:40,821 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 09:04:40,829 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:40,848 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 09:04:40,849 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:40,849 INFO  L85        PathProgramCache]: Analyzing trace with hash -1537472840, now seen corresponding path program 1 times
[2021-10-28 09:04:40,849 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:40,850 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823393712]
[2021-10-28 09:04:40,850 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:40,850 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:40,895 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is unsat
[2021-10-28 09:04:41,007 INFO  L134       CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2021-10-28 09:04:41,008 INFO  L139   FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2021-10-28 09:04:41,008 INFO  L332   FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823393712]
[2021-10-28 09:04:41,008 INFO  L160   FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823393712] provided 1 perfect and 0 imperfect interpolant sequences
[2021-10-28 09:04:41,008 INFO  L186   FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences.
[2021-10-28 09:04:41,009 INFO  L199   FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5
[2021-10-28 09:04:41,009 INFO  L115   tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [407267309]
[2021-10-28 09:04:41,335 INFO  L103   FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2021-10-28 09:04:41,335 INFO  L143   InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants.
[2021-10-28 09:04:41,336 INFO  L145   InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20
[2021-10-28 09:04:41,336 INFO  L87              Difference]: Start difference. First operand 23 states and 35 transitions. cyclomatic complexity: 14 Second operand  has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2021-10-28 09:04:41,660 INFO  L144             Difference]: Subtrahend was deterministic. Have not used determinization.
[2021-10-28 09:04:41,660 INFO  L93              Difference]: Finished difference Result 54 states and 80 transitions.
[2021-10-28 09:04:41,660 INFO  L141   InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. 
[2021-10-28 09:04:41,661 INFO  L82        GeneralOperation]: Start removeNonLiveStates. Operand 54 states and 80 transitions.
[2021-10-28 09:04:41,663 INFO  L131   ngComponentsAnalysis]: Automaton has 4 accepting balls. 44
[2021-10-28 09:04:41,664 INFO  L88        GeneralOperation]: Finished removeNonLiveStates. Reduced from 54 states to 54 states and 80 transitions.
[2021-10-28 09:04:41,664 INFO  L87         BuchiClosureNwa]: Accepting states before buchiClosure: 54
[2021-10-28 09:04:41,665 INFO  L106        BuchiClosureNwa]: Accepting states after buchiClosure: 54
[2021-10-28 09:04:41,665 INFO  L73         IsDeterministic]: Start isDeterministic. Operand 54 states and 80 transitions.
[2021-10-28 09:04:41,666 INFO  L80         IsDeterministic]: Finished isDeterministic. Operand is deterministic.
[2021-10-28 09:04:41,666 INFO  L681         BuchiCegarLoop]: Abstraction has 54 states and 80 transitions.
[2021-10-28 09:04:41,666 INFO  L82        GeneralOperation]: Start minimizeSevpa. Operand 54 states and 80 transitions.
[2021-10-28 09:04:41,669 INFO  L88        GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 31.
[2021-10-28 09:04:41,669 INFO  L82        GeneralOperation]: Start removeUnreachable. Operand  has 31 states, 31 states have (on average 1.4516129032258065) internal successors, (45), 30 states have internal predecessors, (45), 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-10-28 09:04:41,670 INFO  L88        GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 45 transitions.
[2021-10-28 09:04:41,670 INFO  L704         BuchiCegarLoop]: Abstraction has 31 states and 45 transitions.
[2021-10-28 09:04:41,671 INFO  L587         BuchiCegarLoop]: Abstraction has 31 states and 45 transitions.
[2021-10-28 09:04:41,671 INFO  L425         BuchiCegarLoop]: ======== Iteration 4============
[2021-10-28 09:04:41,671 INFO  L72            BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 45 transitions.
[2021-10-28 09:04:41,672 INFO  L131   ngComponentsAnalysis]: Automaton has 3 accepting balls. 28
[2021-10-28 09:04:41,672 INFO  L87            BuchiIsEmpty]: Finished buchiIsEmpty Result is false
[2021-10-28 09:04:41,672 INFO  L119           BuchiIsEmpty]: Starting construction of run
[2021-10-28 09:04:41,673 INFO  L842         BuchiCegarLoop]: Counterexample stem histogram [1, 1]
[2021-10-28 09:04:41,673 INFO  L843         BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1]
[2021-10-28 09:04:41,673 INFO  L791   eck$LassoCheckResult]: Stem: 208#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier;call #t~string0.base, #t~string0.offset := #Ultimate.allocOnStack(2);call write~init~int(48, #t~string0.base, #t~string0.offset, 1);call write~init~int(0, #t~string0.base, 1 + #t~string0.offset, 1);call #t~string1.base, #t~string1.offset := #Ultimate.allocOnStack(13); 209#L-1 havoc main_#res;havoc main_#t~malloc5.base, main_#t~malloc5.offset, main_#t~nondet10, main_#t~mem11.base, main_#t~mem11.offset, main_#t~mem12.base, main_#t~mem12.offset, main_#t~mem7.base, main_#t~mem7.offset, main_#t~mem8.base, main_#t~mem8.offset, main_#t~short9, main_#t~mem13.base, main_#t~mem13.offset, main_#t~nondet14, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~mem16.base, main_#t~mem16.offset, main_#t~mem17.base, main_#t~mem17.offset, main_#t~mem18.base, main_#t~mem18.offset, main_#t~nondet19, main_#t~malloc20.base, main_#t~malloc20.offset, main_#t~mem21.base, main_#t~mem21.offset, main_#t~mem22.base, main_#t~mem22.offset, main_#t~nondet6, main_#t~mem26.base, main_#t~mem26.offset, main_#t~mem27.base, main_#t~mem27.offset, main_#t~mem28.base, main_#t~mem28.offset, main_#t~mem23.base, main_#t~mem23.offset, main_#t~mem24.base, main_#t~mem24.offset, main_#t~short25, main_#t~mem29.base, main_#t~mem29.offset, main_~root~0.base, main_~root~0.offset, main_~n~0.base, main_~n~0.offset, main_~pred~0.base, main_~pred~0.offset;call main_#t~malloc5.base, main_#t~malloc5.offset := #Ultimate.allocOnHeap(8);main_~root~0.base, main_~root~0.offset := main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_#t~malloc5.base, main_#t~malloc5.offset;havoc main_~n~0.base, main_~n~0.offset;call write~$Pointer$(0, 0, main_~root~0.base, main_~root~0.offset, 4);call write~$Pointer$(0, 0, main_~root~0.base, 4 + main_~root~0.offset, 4); 215#L545-2 
[2021-10-28 09:04:41,673 INFO  L793   eck$LassoCheckResult]: Loop: 215#L545-2 assume !!(0 != main_#t~nondet6);havoc main_#t~nondet6;main_~n~0.base, main_~n~0.offset := main_~root~0.base, main_~root~0.offset; 218#L535-2 call main_#t~mem7.base, main_#t~mem7.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4);main_#t~short9 := main_#t~mem7.base != 0 || main_#t~mem7.offset != 0; 204#L534-1 assume !main_#t~short9; 205#L534-3 assume !main_#t~short9;havoc main_#t~mem7.base, main_#t~mem7.offset;havoc main_#t~mem8.base, main_#t~mem8.offset;havoc main_#t~short9; 234#L534-5 call main_#t~mem13.base, main_#t~mem13.offset := read~$Pointer$(main_~n~0.base, main_~n~0.offset, 4); 232#L540 assume !((main_#t~mem13.base == 0 && main_#t~mem13.offset == 0) && 0 != main_#t~nondet14);havoc main_#t~mem13.base, main_#t~mem13.offset;havoc main_#t~nondet14; 227#L540-2 call main_#t~mem18.base, main_#t~mem18.offset := read~$Pointer$(main_~n~0.base, 4 + main_~n~0.offset, 4); 214#L545 assume !((main_#t~mem18.base == 0 && main_#t~mem18.offset == 0) && 0 != main_#t~nondet19);havoc main_#t~mem18.base, main_#t~mem18.offset;havoc main_#t~nondet19; 215#L545-2 
[2021-10-28 09:04:41,674 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:41,674 INFO  L85        PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 4 times
[2021-10-28 09:04:41,674 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:41,678 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [137402923]
[2021-10-28 09:04:41,678 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:41,678 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:41,704 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:41,704 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 09:04:41,727 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:41,732 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 09:04:41,732 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:41,733 INFO  L85        PathProgramCache]: Analyzing trace with hash 2124191284, now seen corresponding path program 1 times
[2021-10-28 09:04:41,733 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:41,733 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [202200833]
[2021-10-28 09:04:41,733 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:41,734 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:41,766 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:41,766 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 09:04:41,772 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:41,775 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 09:04:41,776 INFO  L144       PredicateUnifier]: Initialized classic predicate unifier
[2021-10-28 09:04:41,776 INFO  L85        PathProgramCache]: Analyzing trace with hash -1480214538, now seen corresponding path program 1 times
[2021-10-28 09:04:41,776 INFO  L121   FreeRefinementEngine]: Executing refinement strategy CAMEL
[2021-10-28 09:04:41,777 INFO  L332   FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1653300435]
[2021-10-28 09:04:41,777 INFO  L95    rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2021-10-28 09:04:41,777 INFO  L128          SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2021-10-28 09:04:41,808 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:41,808 INFO  L355             TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders.
[2021-10-28 09:04:41,823 INFO  L136    AnnotateAndAsserter]: Conjunction of SSA is sat
[2021-10-28 09:04:41,840 INFO  L133   FreeRefinementEngine]: Strategy CAMEL found a feasible trace
[2021-10-28 09:04:42,734 INFO  L202        PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 28.10 09:04:42 BoogieIcfgContainer
[2021-10-28 09:04:42,744 INFO  L132        PluginConnector]: ------------------------ END BuchiAutomizer----------------------------
[2021-10-28 09:04:42,745 INFO  L113        PluginConnector]: ------------------------Witness Printer----------------------------
[2021-10-28 09:04:42,745 INFO  L271        PluginConnector]: Initializing Witness Printer...
[2021-10-28 09:04:42,745 INFO  L275        PluginConnector]: Witness Printer initialized
[2021-10-28 09:04:42,746 INFO  L185        PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.10 09:04:39" (3/4) ...
[2021-10-28 09:04:42,750 INFO  L134         WitnessPrinter]: Generating witness for non-termination counterexample
[2021-10-28 09:04:42,824 INFO  L141         WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/witness.graphml
[2021-10-28 09:04:42,825 INFO  L132        PluginConnector]: ------------------------ END Witness Printer----------------------------
[2021-10-28 09:04:42,826 INFO  L168              Benchmark]: Toolchain (without parser) took 4780.94 ms. Allocated memory was 111.1 MB in the beginning and 155.2 MB in the end (delta: 44.0 MB). Free memory was 70.3 MB in the beginning and 123.4 MB in the end (delta: -53.0 MB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,827 INFO  L168              Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 111.1 MB. Free memory was 88.3 MB in the beginning and 88.3 MB in the end (delta: 66.3 kB). There was no memory consumed. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,828 INFO  L168              Benchmark]: CACSL2BoogieTranslator took 640.28 ms. Allocated memory is still 111.1 MB. Free memory was 70.1 MB in the beginning and 78.7 MB in the end (delta: -8.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,829 INFO  L168              Benchmark]: Boogie Procedure Inliner took 62.98 ms. Allocated memory is still 111.1 MB. Free memory was 78.7 MB in the beginning and 76.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,830 INFO  L168              Benchmark]: Boogie Preprocessor took 42.14 ms. Allocated memory is still 111.1 MB. Free memory was 76.7 MB in the beginning and 75.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,831 INFO  L168              Benchmark]: RCFGBuilder took 750.64 ms. Allocated memory is still 111.1 MB. Free memory was 75.0 MB in the beginning and 56.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,832 INFO  L168              Benchmark]: BuchiAutomizer took 3196.24 ms. Allocated memory was 111.1 MB in the beginning and 155.2 MB in the end (delta: 44.0 MB). Free memory was 56.5 MB in the beginning and 125.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,833 INFO  L168              Benchmark]: Witness Printer took 79.77 ms. Allocated memory is still 155.2 MB. Free memory was 125.5 MB in the beginning and 123.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
[2021-10-28 09:04:42,839 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.34 ms. Allocated memory is still 111.1 MB. Free memory was 88.3 MB in the beginning and 88.3 MB in the end (delta: 66.3 kB). There was no memory consumed. Max. memory is 16.1 GB.
 * CACSL2BoogieTranslator took 640.28 ms. Allocated memory is still 111.1 MB. Free memory was 70.1 MB in the beginning and 78.7 MB in the end (delta: -8.6 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB.
 * Boogie Procedure Inliner took 62.98 ms. Allocated memory is still 111.1 MB. Free memory was 78.7 MB in the beginning and 76.7 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Boogie Preprocessor took 42.14 ms. Allocated memory is still 111.1 MB. Free memory was 76.7 MB in the beginning and 75.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * RCFGBuilder took 750.64 ms. Allocated memory is still 111.1 MB. Free memory was 75.0 MB in the beginning and 56.5 MB in the end (delta: 18.5 MB). Peak memory consumption was 16.8 MB. Max. memory is 16.1 GB.
 * BuchiAutomizer took 3196.24 ms. Allocated memory was 111.1 MB in the beginning and 155.2 MB in the end (delta: 44.0 MB). Free memory was 56.5 MB in the beginning and 125.5 MB in the end (delta: -69.0 MB). Peak memory consumption was 25.3 MB. Max. memory is 16.1 GB.
 * Witness Printer took 79.77 ms. Allocated memory is still 155.2 MB. Free memory was 125.5 MB in the beginning and 123.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB.
 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
  - StatisticsResult: Constructed decomposition of program
    Your program was decomposed into 3 terminating modules (3 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.3 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 31 locations.
  - StatisticsResult: Timing statistics
    BüchiAutomizer plugin needed 3.1s and 4 iterations.  TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.3s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 3. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 3 MinimizatonAttempts, 27 StatesRemovedByMinimization, 2 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 31 states and ocurred in iteration 3.	Nontrivial modules had stage [0, 0, 0, 0, 0].	InterpolantCoveringCapabilityFinite: 0/0	InterpolantCoveringCapabilityBuchi: 0/0	HoareTripleCheckerStatistics: 80 SDtfs, 50 SDslu, 76 SDs, 0 SdLazy, 156 SolverSat, 18 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time	LassoAnalysisResults: nont1 unkn0 SFLI2 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso0 LassoPreprocessingBenchmarks: LassoTerminationAnalysisBenchmarks: not availableLassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0	LassoNonterminationAnalysisSatUnbounded: 0	LassoNonterminationAnalysisUnsat: 0	LassoNonterminationAnalysisUnknown: 0	LassoNonterminationAnalysisTime: 0.0s	
  - TerminationAnalysisResult: Nontermination possible
    Buchi Automizer proved that your program is nonterminating for some inputs
  - FixpointNonTerminationResult [Line: 532]: Nontermination argument in form of an infinite program execution.
    Nontermination argument in form of an infinite execution
State at position 0 is
{NULL=31292}
State at position 1 is
{org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58b1c857=0, NULL=0, NULL=31293, NULL=31292, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@759dccaf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6db03169=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4174aaf1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d7227a7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fb1a94c=0, root=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5430628=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40ec5b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@58b1c857=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6db03169=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@24be1e95=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e298c22=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@ef98f3a=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5b775450=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@40ec5b=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18f050f7=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e69d07f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f9ee4f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3e69d07f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@6d7227a7=0, pred=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5430628=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@759dccaf=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7706a623=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a19555d=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bbabf6f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@60f9ee4f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b85b073=0, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57566873=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4174aaf1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4fa666a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@772816aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@7706a623=0, n=-1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@772816aa=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7c794d9c=26, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5e298c22=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@2fb1a94c=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5bbabf6f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@57566873=0, root=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4dd0ad56=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4fa666a4=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@4917852e=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@18f050f7=0, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@4b85b073=0, pred=0, NULL=31294, n=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5a19555d=0}
  - StatisticsResult: NonterminationArgumentStatistics
    Fixpoint
  - NonterminatingLassoResult [Line: 532]: Nonterminating execution
    Found a nonterminating execution for the following lasso shaped sequence of statements.
Stem:
[L529]        struct TreeNode* root = malloc(sizeof(*root)), *n;
[L529]        struct TreeNode* root = malloc(sizeof(*root)), *n;
[L530]        root->left = ((void *)0)
[L531]        root->right = ((void *)0)
Loop:
[L532]  COND TRUE   __VERIFIER_nondet_int()
[L533]              n = root
[L534]  EXPR        n->left
[L534]              n->left && n->right
[L534]  COND FALSE  !(n->left && n->right)
[L540]  EXPR        n->left
[L540]  COND FALSE  !(!n->left && __VERIFIER_nondet_int())
[L545]  EXPR        n->right
[L545]  COND FALSE  !(!n->right && __VERIFIER_nondet_int())
End of lasso representation.
RESULT: Ultimate proved your program to be incorrect!
[2021-10-28 09:04:42,928 INFO  L540       MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68320d61-51a3-40f0-b294-7bc708375cf7/bin/uautomizer-UnR33cPsHg/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0
Received shutdown request...