./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version f470102c Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e0f5271b3ddc7b4a5ff7e7ec42981c4dbcef13b ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/config/KojakReach.xml -i ../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i -s /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Kojak --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6e0f5271b3ddc7b4a5ff7e7ec42981c4dbcef13b ................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared --- Real Ultimate output --- This is Ultimate 0.1.25-f470102 [2019-12-01 06:37:36,806 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 06:37:36,807 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 06:37:36,815 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 06:37:36,815 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 06:37:36,815 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 06:37:36,816 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 06:37:36,818 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 06:37:36,819 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 06:37:36,819 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 06:37:36,820 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 06:37:36,821 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 06:37:36,821 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 06:37:36,822 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 06:37:36,822 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 06:37:36,823 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 06:37:36,824 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 06:37:36,824 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 06:37:36,826 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 06:37:36,827 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 06:37:36,828 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 06:37:36,829 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 06:37:36,830 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 06:37:36,830 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 06:37:36,832 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 06:37:36,832 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 06:37:36,832 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 06:37:36,833 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 06:37:36,833 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 06:37:36,833 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 06:37:36,834 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 06:37:36,834 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 06:37:36,834 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 06:37:36,835 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 06:37:36,835 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 06:37:36,836 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 06:37:36,836 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 06:37:36,836 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 06:37:36,836 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 06:37:36,837 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 06:37:36,837 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 06:37:36,838 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Default.epf [2019-12-01 06:37:36,847 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 06:37:36,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 06:37:36,848 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 06:37:36,848 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 06:37:36,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 06:37:36,849 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 06:37:36,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 06:37:36,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-01 06:37:36,849 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 06:37:36,849 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 06:37:36,849 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 06:37:36,849 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 06:37:36,850 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 06:37:36,850 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 06:37:36,850 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 06:37:36,850 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 06:37:36,850 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 06:37:36,850 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 06:37:36,850 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 06:37:36,850 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 06:37:36,851 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 06:37:36,851 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 06:37:36,851 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 06:37:36,851 INFO L138 SettingsManager]: * Trace refinement strategy=PENGUIN [2019-12-01 06:37:36,851 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-01 06:37:36,851 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 06:37:36,851 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-01 06:37:36,851 INFO L138 SettingsManager]: * To the following directory=dump/ 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-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e0f5271b3ddc7b4a5ff7e7ec42981c4dbcef13b [2019-12-01 06:37:36,950 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 06:37:36,960 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 06:37:36,963 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 06:37:36,964 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 06:37:36,965 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 06:37:36,965 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2019-12-01 06:37:37,009 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/fbcd875ac/9b1f61379961420ca27055b362b13567/FLAG257fa3b6a [2019-12-01 06:37:37,589 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 06:37:37,590 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2019-12-01 06:37:37,604 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/fbcd875ac/9b1f61379961420ca27055b362b13567/FLAG257fa3b6a [2019-12-01 06:37:38,002 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/fbcd875ac/9b1f61379961420ca27055b362b13567 [2019-12-01 06:37:38,004 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 06:37:38,005 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 06:37:38,006 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 06:37:38,006 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 06:37:38,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 06:37:38,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,012 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@39c1ac0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38, skipping insertion in model container [2019-12-01 06:37:38,012 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,018 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 06:37:38,063 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 06:37:38,478 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 06:37:38,490 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 06:37:38,553 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 06:37:38,584 INFO L208 MainTranslator]: Completed translation [2019-12-01 06:37:38,585 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38 WrapperNode [2019-12-01 06:37:38,585 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 06:37:38,585 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 06:37:38,585 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 06:37:38,586 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 06:37:38,591 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,607 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,633 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 06:37:38,633 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 06:37:38,633 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 06:37:38,633 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 06:37:38,640 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,647 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,662 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,666 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,670 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... [2019-12-01 06:37:38,676 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 06:37:38,676 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 06:37:38,676 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 06:37:38,676 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 06:37:38,677 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 06:37:38,721 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-12-01 06:37:38,722 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-12-01 06:37:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2019-12-01 06:37:38,722 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2019-12-01 06:37:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-01 06:37:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-01 06:37:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2019-12-01 06:37:38,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2019-12-01 06:37:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-12-01 06:37:38,722 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-12-01 06:37:38,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-12-01 06:37:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-01 06:37:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-01 06:37:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-01 06:37:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-01 06:37:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-01 06:37:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2019-12-01 06:37:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2019-12-01 06:37:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-12-01 06:37:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-12-01 06:37:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-01 06:37:38,723 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-12-01 06:37:38,723 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-01 06:37:38,724 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2019-12-01 06:37:38,724 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-12-01 06:37:38,724 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2019-12-01 06:37:38,724 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-12-01 06:37:38,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-01 06:37:38,725 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2019-12-01 06:37:38,725 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2019-12-01 06:37:38,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 06:37:38,725 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 06:37:39,237 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-12-01 06:37:39,846 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 06:37:39,846 INFO L287 CfgBuilder]: Removed 68 assume(true) statements. [2019-12-01 06:37:39,847 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:37:39 BoogieIcfgContainer [2019-12-01 06:37:39,847 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 06:37:39,848 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 06:37:39,848 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 06:37:39,856 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 06:37:39,856 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:37:39" (1/1) ... [2019-12-01 06:37:39,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 06:37:39,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:39,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 126 states and 173 transitions. [2019-12-01 06:37:39,893 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 173 transitions. [2019-12-01 06:37:39,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-01 06:37:39,897 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,091 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:40,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 131 states and 194 transitions. [2019-12-01 06:37:40,139 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 194 transitions. [2019-12-01 06:37:40,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-01 06:37:40,141 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:40,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 214 states to 134 states and 214 transitions. [2019-12-01 06:37:40,249 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 214 transitions. [2019-12-01 06:37:40,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-01 06:37:40,251 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:40,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 145 states and 250 transitions. [2019-12-01 06:37:40,456 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 250 transitions. [2019-12-01 06:37:40,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-01 06:37:40,457 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,486 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:40,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 147 states and 253 transitions. [2019-12-01 06:37:40,491 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 253 transitions. [2019-12-01 06:37:40,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-01 06:37:40,493 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,527 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:40,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 146 states and 248 transitions. [2019-12-01 06:37:40,553 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 248 transitions. [2019-12-01 06:37:40,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-01 06:37:40,554 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,605 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,640 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 148 states and 250 transitions. [2019-12-01 06:37:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 250 transitions. [2019-12-01 06:37:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-12-01 06:37:40,642 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,684 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:40,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 272 states to 153 states and 272 transitions. [2019-12-01 06:37:40,924 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 272 transitions. [2019-12-01 06:37:40,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-01 06:37:40,926 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:40,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:40,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:40,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 152 states and 266 transitions. [2019-12-01 06:37:40,999 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 266 transitions. [2019-12-01 06:37:41,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-01 06:37:41,000 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:41,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:41,025 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:41,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:41,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 155 states and 271 transitions. [2019-12-01 06:37:41,154 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 271 transitions. [2019-12-01 06:37:41,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 06:37:41,155 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:41,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:41,214 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:41,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 161 states and 297 transitions. [2019-12-01 06:37:41,544 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 297 transitions. [2019-12-01 06:37:41,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-01 06:37:41,545 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:41,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:41,590 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:41,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:41,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 160 states and 290 transitions. [2019-12-01 06:37:41,619 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 290 transitions. [2019-12-01 06:37:41,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 06:37:41,620 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:41,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:41,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 162 states and 292 transitions. [2019-12-01 06:37:41,703 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 292 transitions. [2019-12-01 06:37:41,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-01 06:37:41,704 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:41,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:41,722 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:41,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:41,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 166 states and 298 transitions. [2019-12-01 06:37:41,778 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 298 transitions. [2019-12-01 06:37:41,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 06:37:41,779 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 06:37:41,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:41,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 320 states to 172 states and 320 transitions. [2019-12-01 06:37:41,874 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 320 transitions. [2019-12-01 06:37:41,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 06:37:41,875 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:41,897 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 06:37:42,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 175 states and 333 transitions. [2019-12-01 06:37:42,061 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 333 transitions. [2019-12-01 06:37:42,062 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-01 06:37:42,062 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,090 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:42,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 337 states to 178 states and 337 transitions. [2019-12-01 06:37:42,099 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 337 transitions. [2019-12-01 06:37:42,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 06:37:42,101 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:42,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 181 states and 341 transitions. [2019-12-01 06:37:42,129 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 341 transitions. [2019-12-01 06:37:42,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 06:37:42,130 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,148 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:42,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 184 states and 346 transitions. [2019-12-01 06:37:42,287 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 346 transitions. [2019-12-01 06:37:42,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2019-12-01 06:37:42,288 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:42,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 186 states and 358 transitions. [2019-12-01 06:37:42,449 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 358 transitions. [2019-12-01 06:37:42,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 06:37:42,450 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,487 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:42,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 362 states to 189 states and 362 transitions. [2019-12-01 06:37:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 362 transitions. [2019-12-01 06:37:42,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 06:37:42,501 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,519 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:42,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 363 states to 189 states and 361 transitions. [2019-12-01 06:37:42,535 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 361 transitions. [2019-12-01 06:37:42,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 06:37:42,536 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,563 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:42,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 371 states to 194 states and 369 transitions. [2019-12-01 06:37:42,687 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 369 transitions. [2019-12-01 06:37:42,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 06:37:42,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,712 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:42,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:42,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 386 states to 196 states and 384 transitions. [2019-12-01 06:37:42,827 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 384 transitions. [2019-12-01 06:37:42,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-12-01 06:37:42,828 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:42,836 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:42,848 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:43,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:43,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 391 states to 199 states and 389 transitions. [2019-12-01 06:37:43,019 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 389 transitions. [2019-12-01 06:37:43,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 06:37:43,020 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:43,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:43,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:43,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:43,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 392 states to 199 states and 388 transitions. [2019-12-01 06:37:43,044 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 388 transitions. [2019-12-01 06:37:43,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-01 06:37:43,045 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:43,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:43,059 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 06:37:43,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:43,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 200 states and 389 transitions. [2019-12-01 06:37:43,094 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 389 transitions. [2019-12-01 06:37:43,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2019-12-01 06:37:43,095 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:43,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:43,109 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:43,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:43,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 394 states to 200 states and 388 transitions. [2019-12-01 06:37:43,120 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 388 transitions. [2019-12-01 06:37:43,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 06:37:43,121 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:43,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:43,138 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:43,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:43,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 400 states to 204 states and 394 transitions. [2019-12-01 06:37:43,156 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 394 transitions. [2019-12-01 06:37:43,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 06:37:43,157 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:43,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:43,181 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:43,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:43,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 426 states to 209 states and 414 transitions. [2019-12-01 06:37:43,608 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 414 transitions. [2019-12-01 06:37:43,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 06:37:43,609 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:43,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:43,635 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 06:37:43,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:43,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 428 states to 211 states and 416 transitions. [2019-12-01 06:37:43,705 INFO L276 IsEmpty]: Start isEmpty. Operand 211 states and 416 transitions. [2019-12-01 06:37:43,706 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 06:37:43,706 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:43,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:43,809 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:44,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:44,473 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 486 states to 227 states and 473 transitions. [2019-12-01 06:37:44,473 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 473 transitions. [2019-12-01 06:37:44,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 06:37:44,475 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:44,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:44,515 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:44,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:44,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 490 states to 230 states and 477 transitions. [2019-12-01 06:37:44,528 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 477 transitions. [2019-12-01 06:37:44,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-01 06:37:44,529 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:44,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:44,542 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:44,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:44,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 491 states to 230 states and 476 transitions. [2019-12-01 06:37:44,555 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 476 transitions. [2019-12-01 06:37:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 06:37:44,556 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:44,570 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:44,581 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:44,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 233 states and 483 transitions. [2019-12-01 06:37:44,582 INFO L276 IsEmpty]: Start isEmpty. Operand 233 states and 483 transitions. [2019-12-01 06:37:44,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:44,583 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:44,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:44,601 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:44,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:44,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 502 states to 236 states and 487 transitions. [2019-12-01 06:37:44,613 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 487 transitions. [2019-12-01 06:37:44,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-01 06:37:44,614 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:44,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:44,626 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:44,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:44,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 240 states and 493 transitions. [2019-12-01 06:37:44,643 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 493 transitions. [2019-12-01 06:37:44,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:44,644 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:44,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:44,660 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:44,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:44,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 512 states to 242 states and 497 transitions. [2019-12-01 06:37:44,734 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 497 transitions. [2019-12-01 06:37:44,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:44,734 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:44,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:44,791 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:45,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:45,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 543 states to 249 states and 522 transitions. [2019-12-01 06:37:45,392 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 522 transitions. [2019-12-01 06:37:45,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:45,392 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:45,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:45,407 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:45,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:45,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 554 states to 251 states and 533 transitions. [2019-12-01 06:37:45,543 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 533 transitions. [2019-12-01 06:37:45,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:45,543 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:45,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:45,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-01 06:37:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:45,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 256 states and 558 transitions. [2019-12-01 06:37:45,866 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 558 transitions. [2019-12-01 06:37:45,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:45,867 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:45,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:45,880 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:45,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:45,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 259 states and 566 transitions. [2019-12-01 06:37:45,892 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 566 transitions. [2019-12-01 06:37:45,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:45,893 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:45,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 591 states to 262 states and 570 transitions. [2019-12-01 06:37:45,918 INFO L276 IsEmpty]: Start isEmpty. Operand 262 states and 570 transitions. [2019-12-01 06:37:45,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 06:37:45,919 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:45,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:45,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:45,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:45,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 265 states and 574 transitions. [2019-12-01 06:37:45,949 INFO L276 IsEmpty]: Start isEmpty. Operand 265 states and 574 transitions. [2019-12-01 06:37:45,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-01 06:37:45,950 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:45,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:45,965 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-12-01 06:37:45,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:45,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 266 states and 574 transitions. [2019-12-01 06:37:45,974 INFO L276 IsEmpty]: Start isEmpty. Operand 266 states and 574 transitions. [2019-12-01 06:37:45,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 06:37:45,974 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:45,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:45,988 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:46,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 603 states to 269 states and 582 transitions. [2019-12-01 06:37:46,002 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 582 transitions. [2019-12-01 06:37:46,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 06:37:46,002 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,016 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:46,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 605 states to 269 states and 581 transitions. [2019-12-01 06:37:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 581 transitions. [2019-12-01 06:37:46,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 06:37:46,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,187 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:46,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 271 states and 596 transitions. [2019-12-01 06:37:46,355 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 596 transitions. [2019-12-01 06:37:46,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-01 06:37:46,356 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:46,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 624 states to 274 states and 600 transitions. [2019-12-01 06:37:46,382 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 600 transitions. [2019-12-01 06:37:46,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:46,382 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,398 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:46,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 275 states and 601 transitions. [2019-12-01 06:37:46,560 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 601 transitions. [2019-12-01 06:37:46,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:46,561 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,627 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:46,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 607 states to 274 states and 583 transitions. [2019-12-01 06:37:46,688 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 583 transitions. [2019-12-01 06:37:46,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:46,689 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,707 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 06:37:46,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 280 states and 597 transitions. [2019-12-01 06:37:46,936 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 597 transitions. [2019-12-01 06:37:46,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:46,937 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,952 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:46,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 622 states to 281 states and 598 transitions. [2019-12-01 06:37:46,964 INFO L276 IsEmpty]: Start isEmpty. Operand 281 states and 598 transitions. [2019-12-01 06:37:46,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:46,965 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:46,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:46,980 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 13 proven. 6 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:46,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:46,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 625 states to 283 states and 601 transitions. [2019-12-01 06:37:46,998 INFO L276 IsEmpty]: Start isEmpty. Operand 283 states and 601 transitions. [2019-12-01 06:37:46,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:46,998 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,015 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2019-12-01 06:37:47,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:47,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 285 states and 603 transitions. [2019-12-01 06:37:47,174 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 603 transitions. [2019-12-01 06:37:47,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:47,175 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,188 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 285 states and 601 transitions. [2019-12-01 06:37:47,201 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 601 transitions. [2019-12-01 06:37:47,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-01 06:37:47,201 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,213 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:47,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:47,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 632 states to 288 states and 605 transitions. [2019-12-01 06:37:47,227 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 605 transitions. [2019-12-01 06:37:47,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 06:37:47,227 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,242 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 12 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2019-12-01 06:37:47,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:47,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 290 states and 607 transitions. [2019-12-01 06:37:47,254 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 607 transitions. [2019-12-01 06:37:47,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 06:37:47,255 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,271 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:47,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:47,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 640 states to 294 states and 613 transitions. [2019-12-01 06:37:47,510 INFO L276 IsEmpty]: Start isEmpty. Operand 294 states and 613 transitions. [2019-12-01 06:37:47,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 06:37:47,511 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,527 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:47,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:47,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 641 states to 295 states and 614 transitions. [2019-12-01 06:37:47,682 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 614 transitions. [2019-12-01 06:37:47,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 06:37:47,683 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,695 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:47,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:47,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 642 states to 295 states and 612 transitions. [2019-12-01 06:37:47,709 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 612 transitions. [2019-12-01 06:37:47,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-12-01 06:37:47,710 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:47,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:47,726 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-01 06:37:48,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 660 states to 300 states and 629 transitions. [2019-12-01 06:37:48,277 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 629 transitions. [2019-12-01 06:37:48,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 06:37:48,278 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,312 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:48,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 665 states to 304 states and 634 transitions. [2019-12-01 06:37:48,597 INFO L276 IsEmpty]: Start isEmpty. Operand 304 states and 634 transitions. [2019-12-01 06:37:48,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 06:37:48,598 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,612 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:48,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 666 states to 305 states and 635 transitions. [2019-12-01 06:37:48,622 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 635 transitions. [2019-12-01 06:37:48,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 06:37:48,623 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,638 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:48,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 669 states to 307 states and 638 transitions. [2019-12-01 06:37:48,657 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 638 transitions. [2019-12-01 06:37:48,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:48,658 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,675 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:48,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 673 states to 310 states and 642 transitions. [2019-12-01 06:37:48,688 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 642 transitions. [2019-12-01 06:37:48,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:48,688 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,704 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:48,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 677 states to 313 states and 646 transitions. [2019-12-01 06:37:48,719 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 646 transitions. [2019-12-01 06:37:48,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-01 06:37:48,719 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,732 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:48,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 678 states to 313 states and 644 transitions. [2019-12-01 06:37:48,752 INFO L276 IsEmpty]: Start isEmpty. Operand 313 states and 644 transitions. [2019-12-01 06:37:48,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:48,752 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:48,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 691 states to 319 states and 657 transitions. [2019-12-01 06:37:48,883 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 657 transitions. [2019-12-01 06:37:48,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:48,884 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,899 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:48,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 321 states and 659 transitions. [2019-12-01 06:37:48,914 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 659 transitions. [2019-12-01 06:37:48,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:48,914 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:48,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:48,930 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-12-01 06:37:49,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 695 states to 323 states and 661 transitions. [2019-12-01 06:37:49,027 INFO L276 IsEmpty]: Start isEmpty. Operand 323 states and 661 transitions. [2019-12-01 06:37:49,027 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:49,027 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:49,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:49,045 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:49,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:49,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 699 states to 326 states and 665 transitions. [2019-12-01 06:37:49,058 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 665 transitions. [2019-12-01 06:37:49,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:49,059 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:49,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:49,072 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-01 06:37:49,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:49,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 327 states and 666 transitions. [2019-12-01 06:37:49,268 INFO L276 IsEmpty]: Start isEmpty. Operand 327 states and 666 transitions. [2019-12-01 06:37:49,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:49,269 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:49,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:49,285 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:49,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:49,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 704 states to 330 states and 670 transitions. [2019-12-01 06:37:49,299 INFO L276 IsEmpty]: Start isEmpty. Operand 330 states and 670 transitions. [2019-12-01 06:37:49,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:49,299 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:49,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:49,378 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 06:37:50,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:50,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 734 states to 338 states and 699 transitions. [2019-12-01 06:37:50,407 INFO L276 IsEmpty]: Start isEmpty. Operand 338 states and 699 transitions. [2019-12-01 06:37:50,408 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-01 06:37:50,408 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:50,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:50,420 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-01 06:37:50,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:50,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 739 states to 341 states and 704 transitions. [2019-12-01 06:37:50,559 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 704 transitions. [2019-12-01 06:37:50,560 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:50,560 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:50,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:50,574 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:50,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:50,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 344 states and 708 transitions. [2019-12-01 06:37:50,701 INFO L276 IsEmpty]: Start isEmpty. Operand 344 states and 708 transitions. [2019-12-01 06:37:50,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:50,702 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:50,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:50,716 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:50,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:50,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 743 states to 345 states and 708 transitions. [2019-12-01 06:37:50,725 INFO L276 IsEmpty]: Start isEmpty. Operand 345 states and 708 transitions. [2019-12-01 06:37:50,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:50,726 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:50,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:50,740 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:50,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:50,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 746 states to 347 states and 711 transitions. [2019-12-01 06:37:50,752 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 711 transitions. [2019-12-01 06:37:50,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 06:37:50,753 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:50,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:50,769 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:50,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:50,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 750 states to 350 states and 715 transitions. [2019-12-01 06:37:50,782 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 715 transitions. [2019-12-01 06:37:50,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 06:37:50,783 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:50,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-12-01 06:37:50,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:50,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 751 states to 350 states and 714 transitions. [2019-12-01 06:37:50,979 INFO L276 IsEmpty]: Start isEmpty. Operand 350 states and 714 transitions. [2019-12-01 06:37:50,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:50,980 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:50,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:50,992 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-12-01 06:37:51,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:51,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 353 states and 720 transitions. [2019-12-01 06:37:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 353 states and 720 transitions. [2019-12-01 06:37:51,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:51,009 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:51,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:51,021 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-01 06:37:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:51,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 761 states to 356 states and 724 transitions. [2019-12-01 06:37:51,034 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 724 transitions. [2019-12-01 06:37:51,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-01 06:37:51,034 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:51,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:51,050 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2019-12-01 06:37:51,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:51,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 765 states to 359 states and 728 transitions. [2019-12-01 06:37:51,067 INFO L276 IsEmpty]: Start isEmpty. Operand 359 states and 728 transitions. [2019-12-01 06:37:51,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-01 06:37:51,067 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:51,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-01 06:37:51,079 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-12-01 06:37:51,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:51,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 770 states to 362 states and 733 transitions. [2019-12-01 06:37:51,366 INFO L276 IsEmpty]: Start isEmpty. Operand 362 states and 733 transitions. [2019-12-01 06:37:51,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-01 06:37:51,366 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:51,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 06:37:51,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 06:37:51,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 06:37:51,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-01 06:37:51,753 WARN L483 CodeCheckObserver]: This program is UNSAFE, Check terminated with 85 iterations. [2019-12-01 06:37:51,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck CFG 01.12 06:37:51 ImpRootNode [2019-12-01 06:37:51,858 INFO L132 PluginConnector]: ------------------------ END CodeCheck---------------------------- [2019-12-01 06:37:51,858 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-12-01 06:37:51,858 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-12-01 06:37:51,858 INFO L275 PluginConnector]: Witness Printer initialized [2019-12-01 06:37:51,859 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:37:39" (3/4) ... [2019-12-01 06:37:51,862 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-12-01 06:37:51,862 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-12-01 06:37:51,865 INFO L168 Benchmark]: Toolchain (without parser) took 13858.21 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 549.5 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -185.4 MB). Peak memory consumption was 364.1 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:51,865 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 06:37:51,866 INFO L168 Benchmark]: CACSL2BoogieTranslator took 578.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:51,866 INFO L168 Benchmark]: Boogie Procedure Inliner took 47.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:51,867 INFO L168 Benchmark]: Boogie Preprocessor took 42.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:51,867 INFO L168 Benchmark]: RCFGBuilder took 1171.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 877.8 MB in the end (delta: 172.8 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:51,868 INFO L168 Benchmark]: CodeCheck took 12009.95 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.7 MB). Free memory was 877.8 MB in the beginning and 1.1 GB in the end (delta: -247.3 MB). Peak memory consumption was 178.4 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:51,868 INFO L168 Benchmark]: Witness Printer took 4.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 06:37:51,871 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - StatisticsResult: Ultimate CodeCheck benchmark data CFG has 15 procedures, 127 locations, 1 error locations. Result: UNSAFE, OverallTime: 11.8s, OverallIterations: 85, TraceHistogramMax: 0, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: -717178632 SDtfs, 517571366 SDslu, 1642319508 SDs, 0 SdLazy, -1454576698 SolverSat, -700919560 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 28.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32993 GetRequests, 32608 SyntacticMatches, 119 SemanticMatches, 266 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34713 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=-1occurred in iteration=-1, traceCheckStatistics: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 2397 NumberOfCodeBlocks, 2397 NumberOfCodeBlocksAsserted, 85 NumberOfCheckSat, 2272 ConstructedInterpolants, 0 QuantifiedInterpolants, 150304 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 84 InterpolantComputations, 57 PerfectInterpolantSequences, 844/993 InterpolantCoveringCapability, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available - UnprovableResult [Line: 3303]: Unable to prove that call of __VERIFIER_error() unreachable Unable to prove that call of __VERIFIER_error() unreachable Reason: overapproximation of large string literal at line 2945, overapproximation of bitwiseOr at line 2667. Possible FailurePath: [L2752] int ldv_irq_1_2 = 0; [L2753] int LDV_IN_INTERRUPT = 1; [L2754] int ldv_irq_1_3 = 0; [L2755] void *ldv_irq_data_1_1 ; [L2756] int ldv_irq_1_1 = 0; [L2757] int ldv_irq_1_0 = 0; [L2758] int probed_2 = 0; [L2759] int ldv_irq_line_1_3 ; [L2760] void *ldv_irq_data_1_0 ; [L2761] int ldv_state_variable_0 ; [L2762] int ldv_irq_line_1_0 ; [L2763] int ldv_state_variable_2 ; [L2764] void *ldv_irq_data_1_3 ; [L2765] int ref_cnt ; [L2766] int ldv_irq_line_1_1 ; [L2767] struct platform_device *iio_interrupt_trigger_driver_group1 ; [L2768] void *ldv_irq_data_1_2 ; [L2769] int ldv_state_variable_1 ; [L2770] int ldv_irq_line_1_2 ; [L2867] static struct iio_trigger_ops const iio_interrupt_trigger_ops = {& __this_module, 0, 0, 0}; [L2944-L2954] static struct platform_driver iio_interrupt_trigger_driver = {& iio_interrupt_trigger_probe, & iio_interrupt_trigger_remove, 0, 0, 0, {"iio_interrupt_trigger", 0, 0, 0, (_Bool)0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0}, 0, (_Bool)0}; [L2970] int ldv_retval_0 ; [L2971] int ldv_retval_1 ; [L2974] int ldv_retval_2 ; [L3342] int ldv_module_refcounter = 1; [L3123] int tmp ; [L3124] int tmp___0 ; [L3125] int tmp___1 ; [L3128] ldv_state_variable_1 = 1 [L3129] ref_cnt = 0 [L3130] ldv_state_variable_0 = 1 [L3131] ldv_state_variable_2 = 0 VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0] [L3133] tmp = __VERIFIER_nondet_int() [L3135] case 0: [L3141] case 1: VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0] [L3142] COND TRUE ldv_state_variable_0 != 0 [L3143] tmp___0 = __VERIFIER_nondet_int() [L3145] case 0: [L3153] case 1: VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=0, probed_2=0, ref_cnt=0] [L3154] COND TRUE ldv_state_variable_0 == 1 [L2957] int tmp ; [L3280] ldv_func_ret_type___0 ldv_func_res ; [L3281] int tmp ; [L3410] return __VERIFIER_nondet_int(); [L3283] tmp = __platform_driver_register(ldv_func_arg1, ldv_func_arg2) [L3284] ldv_func_res = tmp [L3285] ldv_state_variable_2 = 1 [L3088] void *tmp ; [L2712] void *p ; [L2713] void *tmp ; [L2715] EXPR, FCALL calloc(1UL, size) VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={0:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=1, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2715] tmp = calloc(1UL, size) [L2716] p = tmp [L2718] return (p); [L3090] tmp = ldv_init_zalloc(1472UL) [L3091] iio_interrupt_trigger_driver_group1 = (struct platform_device *)tmp [L3287] return (ldv_func_res); [L2959] tmp = ldv___platform_driver_register_10(& iio_interrupt_trigger_driver, & __this_module) [L2960] return (tmp); [L3155] ldv_retval_0 = iio_interrupt_trigger_driver_init() [L3156] COND TRUE ldv_retval_0 == 0 [L3157] ldv_state_variable_0 = 3 VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3160] COND FALSE !(ldv_retval_0 != 0) VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3133] tmp = __VERIFIER_nondet_int() [L3135] case 0: [L3141] case 1: [L3175] case 2: VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3176] COND TRUE ldv_state_variable_2 != 0 [L3177] tmp___1 = __VERIFIER_nondet_int() [L3179] case 0: VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3180] COND TRUE ldv_state_variable_2 == 1 VAL [__this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3181] CALL iio_interrupt_trigger_probe(iio_interrupt_trigger_driver_group1) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2870] struct iio_interrupt_trigger_info *trig_info ; [L2871] struct iio_trigger *trig ; [L2872] unsigned long irqflags ; [L2873] struct resource *irq_res ; [L2874] int irq ; [L2875] int ret ; [L2876] void *tmp ; [L2878] ret = 0 [L3438] CALL, EXPR ldv_malloc(sizeof(struct resource)) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=56, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2678] void *p ; [L2679] void *tmp ; [L2680] int tmp___0 ; [L2682] tmp___0 = __VERIFIER_nondet_int() [L2683] COND FALSE !(tmp___0 != 0) [L2686] tmp = malloc(size) [L2687] p = tmp [L2689] return (p); [L3438] RET, EXPR ldv_malloc(sizeof(struct resource)) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3438] return ldv_malloc(sizeof(struct resource)); [L2879] irq_res = platform_get_resource(pdev, 1024U, 0U) [L2880] COND FALSE !((unsigned long )irq_res == (unsigned long )((struct resource *)0)) [L2884] EXPR irq_res->flags [L2884] irqflags = (irq_res->flags & 15UL) | 128UL [L2885] EXPR irq_res->start [L2885] irq = (int )irq_res->start [L2886] trig = iio_trigger_alloc("irqtrig%d", irq) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2887] COND FALSE !((unsigned long )trig == (unsigned long )((struct iio_trigger *)0)) [L2665] void *tmp ; [L2656] void *tmp___2 ; [L2651] CALL, EXPR ldv_malloc(size) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, \old(size)=4, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2678] void *p ; [L2679] void *tmp ; [L2680] int tmp___0 ; [L2682] tmp___0 = __VERIFIER_nondet_int() [L2683] COND TRUE tmp___0 != 0 [L2684] return ((void *)0); [L2651] RET, EXPR ldv_malloc(size) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2651] return ldv_malloc(size); [L2658] tmp___2 = __kmalloc(size, flags) [L2659] return (tmp___2); [L2667] tmp = kmalloc(size, flags | 32768U) [L2668] return (tmp); [L2892] tmp = kzalloc(4UL, 208U) [L2893] trig_info = (struct iio_interrupt_trigger_info *)tmp VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2894] COND TRUE (unsigned long )trig_info == (unsigned long )((struct iio_interrupt_trigger_info *)0) [L2895] ret = -12 VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2921] CALL iio_trigger_put(trig) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L2836] EXPR trig->ops [L2836] (trig->ops)->owner [L3233] CALL ldv_module_put(ldv_func_arg1) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, module={-4190:4191}, probed_2=0, ref_cnt=0] [L3373] COND TRUE (unsigned long )module != (unsigned long )((struct module *)0) VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, module={-4190:4191}, module={-4190:4191}, probed_2=0, ref_cnt=0] [L3374] COND TRUE ldv_module_refcounter <= 1 VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, module={-4190:4191}, module={-4190:4191}, probed_2=0, ref_cnt=0] [L3375] CALL ldv_error() VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] [L3303] __VERIFIER_error() VAL [\old(ldv_irq_1_0)=0, \old(ldv_irq_1_1)=0, \old(ldv_irq_1_2)=0, \old(ldv_irq_1_3)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_0)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_1)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_2)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_data_1_3)=0, \old(ldv_irq_line_1_0)=0, \old(ldv_irq_line_1_1)=0, \old(ldv_irq_line_1_2)=0, \old(ldv_irq_line_1_3)=0, \old(ldv_module_refcounter)=1, __this_module={28:36}, iio_interrupt_trigger_driver={2271:0}, iio_interrupt_trigger_driver_group1={-167717797118167243292675:0}, iio_interrupt_trigger_ops={2270:0}, LDV_IN_INTERRUPT=1, ldv_irq_1_0=0, ldv_irq_1_1=0, ldv_irq_1_2=0, ldv_irq_1_3=0, ldv_irq_data_1_0={0:0}, ldv_irq_data_1_1={0:0}, ldv_irq_data_1_2={0:0}, ldv_irq_data_1_3={0:0}, ldv_irq_line_1_0=0, ldv_irq_line_1_1=0, ldv_irq_line_1_2=0, ldv_irq_line_1_3=0, ldv_module_refcounter=1, ldv_retval_0=0, ldv_retval_1=0, ldv_retval_2=0, ldv_state_variable_0=3, ldv_state_variable_1=1, ldv_state_variable_2=1, probed_2=0, ref_cnt=0] * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 961.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 578.84 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 123.7 MB). Free memory was 939.7 MB in the beginning and 1.1 GB in the end (delta: -124.5 MB). Peak memory consumption was 31.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 47.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.92 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1171.44 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 877.8 MB in the end (delta: 172.8 MB). Peak memory consumption was 172.8 MB. Max. memory is 11.5 GB. * CodeCheck took 12009.95 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 425.7 MB). Free memory was 877.8 MB in the beginning and 1.1 GB in the end (delta: -247.3 MB). Peak memory consumption was 178.4 MB. Max. memory is 11.5 GB. * Witness Printer took 4.24 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces Received shutdown request... ### Bit-precise run ### This is Ultimate 0.1.25-f470102 [2019-12-01 06:37:53,241 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-01 06:37:53,243 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-01 06:37:53,250 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-01 06:37:53,251 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-01 06:37:53,251 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-01 06:37:53,252 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-01 06:37:53,254 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-01 06:37:53,255 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-01 06:37:53,256 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-01 06:37:53,256 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-01 06:37:53,257 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-01 06:37:53,257 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-01 06:37:53,258 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-01 06:37:53,259 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-01 06:37:53,259 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-01 06:37:53,260 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-01 06:37:53,261 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-01 06:37:53,262 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-01 06:37:53,263 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-01 06:37:53,265 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-01 06:37:53,265 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-01 06:37:53,266 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-01 06:37:53,267 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-01 06:37:53,269 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-01 06:37:53,269 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-01 06:37:53,269 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-01 06:37:53,270 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-01 06:37:53,270 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-01 06:37:53,270 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-01 06:37:53,271 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-01 06:37:53,271 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-01 06:37:53,272 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-01 06:37:53,272 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-01 06:37:53,273 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-01 06:37:53,273 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-01 06:37:53,273 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-01 06:37:53,274 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-01 06:37:53,274 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-01 06:37:53,274 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-01 06:37:53,275 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-01 06:37:53,275 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/config/svcomp-Reach-64bit-Kojak_Bitvector.epf [2019-12-01 06:37:53,285 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-01 06:37:53,285 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-01 06:37:53,286 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2019-12-01 06:37:53,286 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ALWAYS [2019-12-01 06:37:53,286 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-01 06:37:53,287 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-01 06:37:53,287 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-01 06:37:53,287 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-01 06:37:53,287 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-01 06:37:53,287 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-01 06:37:53,287 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-01 06:37:53,287 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2019-12-01 06:37:53,287 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2019-12-01 06:37:53,288 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2019-12-01 06:37:53,288 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-01 06:37:53,288 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-01 06:37:53,288 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-01 06:37:53,288 INFO L136 SettingsManager]: Preferences of CodeCheck differ from their defaults: [2019-12-01 06:37:53,288 INFO L138 SettingsManager]: * Timeout in seconds=1000000 [2019-12-01 06:37:53,288 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-01 06:37:53,289 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-01 06:37:53,289 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 06:37:53,289 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-01 06:37:53,289 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-01 06:37:53,289 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-01 06:37:53,289 INFO L138 SettingsManager]: * Trace refinement strategy=WALRUS [2019-12-01 06:37:53,289 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --rewrite-divk --print-success --lang smt [2019-12-01 06:37:53,289 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-01 06:37:53,290 INFO L138 SettingsManager]: * Use separate solver for trace checks=false [2019-12-01 06:37:53,290 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-01 06:37:53,290 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2019-12-01 06:37:53,290 INFO L138 SettingsManager]: * To the following directory=dump/ 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-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Kojak Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6e0f5271b3ddc7b4a5ff7e7ec42981c4dbcef13b [2019-12-01 06:37:53,460 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-01 06:37:53,470 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-01 06:37:53,472 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-01 06:37:53,474 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-01 06:37:53,474 INFO L275 PluginConnector]: CDTParser initialized [2019-12-01 06:37:53,475 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/../../sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2019-12-01 06:37:53,521 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/a89b33de9/2861ee4f867f4e2c8b97f5908eaf377f/FLAGa52e6acd7 [2019-12-01 06:37:53,995 INFO L306 CDTParser]: Found 1 translation units. [2019-12-01 06:37:53,996 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/sv-benchmarks/c/ldv-linux-4.2-rc1/linux-4.2-rc1.tar.xz-08_1a-drivers--iio--trigger--iio-trig-interrupt.ko-entry_point.cil.out.i [2019-12-01 06:37:54,010 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/a89b33de9/2861ee4f867f4e2c8b97f5908eaf377f/FLAGa52e6acd7 [2019-12-01 06:37:54,322 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/data/a89b33de9/2861ee4f867f4e2c8b97f5908eaf377f [2019-12-01 06:37:54,328 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-01 06:37:54,330 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-12-01 06:37:54,332 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-01 06:37:54,332 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-01 06:37:54,335 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-01 06:37:54,335 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:37:54" (1/1) ... [2019-12-01 06:37:54,337 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36623ed3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:54, skipping insertion in model container [2019-12-01 06:37:54,337 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 06:37:54" (1/1) ... [2019-12-01 06:37:54,342 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-01 06:37:54,384 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 06:37:54,792 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 06:37:54,807 INFO L200 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2019-12-01 06:37:54,879 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-01 06:37:54,950 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 06:37:54,954 INFO L203 MainTranslator]: Completed pre-run [2019-12-01 06:37:55,020 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-01 06:37:55,063 INFO L208 MainTranslator]: Completed translation [2019-12-01 06:37:55,063 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55 WrapperNode [2019-12-01 06:37:55,064 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-01 06:37:55,064 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-01 06:37:55,064 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-01 06:37:55,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-01 06:37:55,071 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,092 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,120 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-01 06:37:55,121 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-01 06:37:55,121 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-01 06:37:55,121 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-01 06:37:55,128 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,129 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,136 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,136 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,156 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... [2019-12-01 06:37:55,167 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-01 06:37:55,168 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-01 06:37:55,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-01 06:37:55,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-01 06:37:55,169 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 06:37:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_71cd8c21-26c4-4ebe-ae99-8b00a5611d85/bin/ukojak/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:10000 [2019-12-01 06:37:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure dev_get_drvdata [2019-12-01 06:37:55,227 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_get_drvdata [2019-12-01 06:37:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_probe [2019-12-01 06:37:55,227 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_probe [2019-12-01 06:37:55,227 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-12-01 06:37:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-01 06:37:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE8 [2019-12-01 06:37:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_irq_1 [2019-12-01 06:37:55,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_irq_1 [2019-12-01 06:37:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2019-12-01 06:37:55,228 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_stop [2019-12-01 06:37:55,228 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_stop [2019-12-01 06:37:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.meminit [2019-12-01 06:37:55,229 INFO L138 BoogieDeclarations]: Found implementation of procedure #Ultimate.meminit [2019-12-01 06:37:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-12-01 06:37:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_malloc [2019-12-01 06:37:55,229 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_malloc [2019-12-01 06:37:55,229 INFO L130 BoogieDeclarations]: Found specification of procedure iio_trigger_put [2019-12-01 06:37:55,229 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_trigger_put [2019-12-01 06:37:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_module_put [2019-12-01 06:37:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_module_put [2019-12-01 06:37:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-01 06:37:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2019-12-01 06:37:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure dev_set_drvdata [2019-12-01 06:37:55,230 INFO L138 BoogieDeclarations]: Found implementation of procedure dev_set_drvdata [2019-12-01 06:37:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-12-01 06:37:55,230 INFO L130 BoogieDeclarations]: Found specification of procedure kfree [2019-12-01 06:37:55,231 INFO L138 BoogieDeclarations]: Found implementation of procedure kfree [2019-12-01 06:37:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure free_irq [2019-12-01 06:37:55,231 INFO L138 BoogieDeclarations]: Found implementation of procedure free_irq [2019-12-01 06:37:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2019-12-01 06:37:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2019-12-01 06:37:55,231 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_error [2019-12-01 06:37:55,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_error [2019-12-01 06:37:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure disable_suitable_irq_1 [2019-12-01 06:37:55,232 INFO L138 BoogieDeclarations]: Found implementation of procedure disable_suitable_irq_1 [2019-12-01 06:37:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-12-01 06:37:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure iio_interrupt_trigger_remove [2019-12-01 06:37:55,232 INFO L138 BoogieDeclarations]: Found implementation of procedure iio_interrupt_trigger_remove [2019-12-01 06:37:55,232 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-01 06:37:55,232 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-01 06:37:55,702 INFO L691 $ProcedureCfgBuilder]: dead code at ProgramPoint ldv_stopFINAL: assume true; [2019-12-01 06:37:56,783 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-01 06:37:56,783 INFO L287 CfgBuilder]: Removed 68 assume(true) statements. [2019-12-01 06:37:56,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:37:56 BoogieIcfgContainer [2019-12-01 06:37:56,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-01 06:37:56,784 INFO L113 PluginConnector]: ------------------------CodeCheck---------------------------- [2019-12-01 06:37:56,785 INFO L271 PluginConnector]: Initializing CodeCheck... [2019-12-01 06:37:56,793 INFO L275 PluginConnector]: CodeCheck initialized [2019-12-01 06:37:56,794 INFO L185 PluginConnector]: Executing the observer CodeCheckObserver from plugin CodeCheck for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 06:37:56" (1/1) ... [2019-12-01 06:37:56,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-01 06:37:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand no size info available [2019-12-01 06:37:56,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 126 states and 173 transitions. [2019-12-01 06:37:56,834 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 173 transitions. [2019-12-01 06:37:56,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-12-01 06:37:56,836 INFO L428 CodeCheckObserver]: Error Path is FOUND. [2019-12-01 06:37:56,872 FATAL L? ?]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: Sort BitVec not declared at de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.sort(WrapperScript.java:223) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.NonDeclaringTermTransferrer.transferSort(NonDeclaringTermTransferrer.java:111) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.DeclarableSortSymbol.defineOrDeclare(DeclarableSortSymbol.java:79) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:145) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.scripttransfer.HistoryRecordingScript.transferHistoryFromRecord(HistoryRecordingScript.java:170) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.SmtFunctionsAndAxioms.transferAllSymbols(SmtFunctionsAndAxioms.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck.CodeCheckObserver.process(CodeCheckObserver.java:448) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.CFGWalker.runObserver(CFGWalker.java:57) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.runObserver(BaseWalker.java:93) at de.uni_freiburg.informatik.ultimate.core.coreplugin.modelwalker.BaseWalker.run(BaseWalker.java:86) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:167) 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:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) [2019-12-01 06:37:56,875 INFO L168 Benchmark]: Toolchain (without parser) took 2546.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 947.0 MB in the beginning and 860.3 MB in the end (delta: 86.7 MB). Peak memory consumption was 221.9 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:56,876 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-12-01 06:37:56,876 INFO L168 Benchmark]: CACSL2BoogieTranslator took 732.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -109.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:56,877 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:56,877 INFO L168 Benchmark]: Boogie Preprocessor took 47.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:56,878 INFO L168 Benchmark]: RCFGBuilder took 1616.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 867.1 MB in the end (delta: 175.7 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:56,878 INFO L168 Benchmark]: CodeCheck took 89.42 ms. Allocated memory is still 1.2 GB. Free memory was 867.1 MB in the beginning and 860.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. [2019-12-01 06:37:56,880 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: - ExceptionOrErrorResult: SMTLIBException: Sort BitVec not declared de.uni_freiburg.informatik.ultimate.plugins.generator.codecheck: SMTLIBException: Sort BitVec not declared: de.uni_freiburg.informatik.ultimate.logic.NoopScript.sort(NoopScript.java:412) * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 981.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 732.05 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 135.3 MB). Free memory was 947.0 MB in the beginning and 1.1 GB in the end (delta: -109.4 MB). Peak memory consumption was 62.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.28 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 47.05 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1616.29 ms. Allocated memory is still 1.2 GB. Free memory was 1.0 GB in the beginning and 867.1 MB in the end (delta: 175.7 MB). Peak memory consumption was 175.7 MB. Max. memory is 11.5 GB. * CodeCheck took 89.42 ms. Allocated memory is still 1.2 GB. Free memory was 867.1 MB in the beginning and 860.3 MB in the end (delta: 6.8 MB). Peak memory consumption was 6.8 MB. Max. memory is 11.5 GB. RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...