./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83658644ab59c175befe18129a61686a7f8ef5283dc72c7f2a03865a8223d162 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:10,937 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:10,939 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:10,970 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:10,970 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:10,977 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:10,980 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:10,985 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:10,987 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:10,990 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:10,991 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:10,992 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:10,993 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:10,995 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:10,996 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:10,998 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:10,999 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:11,000 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:11,002 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:11,006 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:11,007 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:11,008 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:11,010 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:11,010 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:11,016 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:11,016 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:11,017 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:11,018 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:11,018 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:11,019 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:11,019 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:11,020 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:11,021 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:11,022 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:11,023 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:11,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:11,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:11,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:11,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:11,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:11,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:11,027 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 17:29:11,059 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:11,060 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:11,060 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:11,061 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:11,061 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:11,062 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:11,062 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:11,062 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:11,063 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:11,063 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:11,064 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:11,064 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 17:29:11,064 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:11,064 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:11,064 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:11,065 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:11,065 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:11,065 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:11,065 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:11,065 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:11,066 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:11,066 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:11,066 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:11,066 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:11,066 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:11,067 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:11,067 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:11,068 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:11,068 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 17:29:11,068 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 17:29:11,069 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:11,069 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:11,069 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:11,069 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83658644ab59c175befe18129a61686a7f8ef5283dc72c7f2a03865a8223d162 [2022-02-20 17:29:11,292 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:11,315 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:11,317 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:11,318 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:11,318 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:11,319 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c [2022-02-20 17:29:11,365 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa499b944/24ea017e601d4cf8b1d4911270839376/FLAGec18634cb [2022-02-20 17:29:11,711 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:11,711 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c [2022-02-20 17:29:11,715 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa499b944/24ea017e601d4cf8b1d4911270839376/FLAGec18634cb [2022-02-20 17:29:12,153 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa499b944/24ea017e601d4cf8b1d4911270839376 [2022-02-20 17:29:12,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:12,156 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:12,161 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:12,161 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:12,164 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:12,165 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,166 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d066ff6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12, skipping insertion in model container [2022-02-20 17:29:12,166 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,171 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:12,182 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:12,280 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c[555,568] [2022-02-20 17:29:12,293 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:12,300 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:12,310 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c[555,568] [2022-02-20 17:29:12,315 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:12,325 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:12,326 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12 WrapperNode [2022-02-20 17:29:12,326 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:12,326 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:12,326 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:12,327 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:12,331 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,336 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,352 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:29:12,353 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:12,354 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:12,354 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:12,354 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:12,360 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,360 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,362 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,365 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,368 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,369 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,371 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:12,371 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:12,372 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:12,372 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:12,372 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (1/1) ... [2022-02-20 17:29:12,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:12,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:12,404 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:29:12,411 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:29:12,431 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:12,431 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:12,432 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 17:29:12,432 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:12,433 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:12,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:12,482 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:12,483 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:12,606 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:12,616 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:12,616 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:12,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:12 BoogieIcfgContainer [2022-02-20 17:29:12,618 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:12,632 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:12,633 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:12,636 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:12,636 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:12" (1/3) ... [2022-02-20 17:29:12,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eead888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:12, skipping insertion in model container [2022-02-20 17:29:12,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:12" (2/3) ... [2022-02-20 17:29:12,637 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1eead888 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:12, skipping insertion in model container [2022-02-20 17:29:12,638 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:12" (3/3) ... [2022-02-20 17:29:12,639 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound2.c [2022-02-20 17:29:12,646 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:12,647 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:12,701 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:12,709 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:29:12,709 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:12,724 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:12,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:12,727 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:12,728 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:12,728 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:12,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:12,733 INFO L85 PathProgramCache]: Analyzing trace with hash -1975646755, now seen corresponding path program 1 times [2022-02-20 17:29:12,739 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:12,740 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [580370116] [2022-02-20 17:29:12,740 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:12,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:12,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:12,846 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2022-02-20 17:29:12,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:12,862 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:12,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:12,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:12,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:29:12,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 17:29:12,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:12,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:12,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:12,873 INFO L290 TraceCheckUtils]: 2: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:12,873 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:29:12,873 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {28#true} is VALID [2022-02-20 17:29:12,873 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {28#true} is VALID [2022-02-20 17:29:12,874 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if main_~z~0#1 % 4294967296 >= 0 && main_~z~0#1 % 4294967296 <= 2 then 1 else 0)); {28#true} is VALID [2022-02-20 17:29:12,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:12,875 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:12,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:12,875 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {29#false} {28#true} #51#return; {29#false} is VALID [2022-02-20 17:29:12,875 INFO L290 TraceCheckUtils]: 7: Hoare triple {29#false} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {29#false} is VALID [2022-02-20 17:29:12,876 INFO L272 TraceCheckUtils]: 8: Hoare triple {29#false} call assume_abort_if_not((if main_~k~0#1 % 4294967296 >= 0 && main_~k~0#1 % 4294967296 <= 2 then 1 else 0)); {28#true} is VALID [2022-02-20 17:29:12,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:12,876 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume 0 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:12,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:12,877 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29#false} {29#false} #53#return; {29#false} is VALID [2022-02-20 17:29:12,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {29#false} is VALID [2022-02-20 17:29:12,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:12,878 INFO L272 TraceCheckUtils]: 15: Hoare triple {29#false} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {29#false} is VALID [2022-02-20 17:29:12,878 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:29:12,878 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume 0 == ~cond; {29#false} is VALID [2022-02-20 17:29:12,878 INFO L290 TraceCheckUtils]: 18: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:12,879 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:12,882 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:12,882 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [580370116] [2022-02-20 17:29:12,883 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [580370116] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:12,883 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:12,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:12,885 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [467577361] [2022-02-20 17:29:12,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:12,891 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:29:12,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:12,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:12,933 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:12,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:12,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:12,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:12,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:12,961 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:13,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:13,041 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-02-20 17:29:13,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:13,042 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 19 [2022-02-20 17:29:13,042 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:13,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:13,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:13,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:13,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:13,062 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:29:13,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:13,154 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:29:13,155 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:13,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:13,161 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:13,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:13,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:13,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:13,189 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:13,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:13,191 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:13,192 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:13,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:13,197 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:13,197 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:13,197 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:13,198 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:13,199 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:13,202 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:13,205 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:13,208 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:13,208 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:13,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:13,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:13,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:13,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:13,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:13,215 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-02-20 17:29:13,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:13,215 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:13,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 17:29:13,216 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:13,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:13,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:13,217 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:13,218 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 17:29:13,219 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:13,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:13,221 INFO L85 PathProgramCache]: Analyzing trace with hash 1719515233, now seen corresponding path program 1 times [2022-02-20 17:29:13,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:13,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023844339] [2022-02-20 17:29:13,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:13,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:13,253 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:13,253 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2002431870] [2022-02-20 17:29:13,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:13,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:13,254 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:13,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:13,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 17:29:13,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:13,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 17:29:13,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:13,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:13,708 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-02-20 17:29:13,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {172#true} is VALID [2022-02-20 17:29:13,709 INFO L272 TraceCheckUtils]: 2: Hoare triple {172#true} call assume_abort_if_not((if main_~z~0#1 % 4294967296 >= 0 && main_~z~0#1 % 4294967296 <= 2 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:13,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#true} ~cond := #in~cond; {186#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-02-20 17:29:13,712 INFO L290 TraceCheckUtils]: 4: Hoare triple {186#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {190#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:29:13,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {190#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {190#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-02-20 17:29:13,714 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {190#(not (= |assume_abort_if_not_#in~cond| 0))} {172#true} #51#return; {197#(<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2)} is VALID [2022-02-20 17:29:13,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#(<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2)} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {197#(<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2)} is VALID [2022-02-20 17:29:13,714 INFO L272 TraceCheckUtils]: 8: Hoare triple {197#(<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2)} call assume_abort_if_not((if main_~k~0#1 % 4294967296 >= 0 && main_~k~0#1 % 4294967296 <= 2 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:13,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:29:13,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:29:13,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:29:13,716 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {172#true} {197#(<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2)} #53#return; {197#(<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2)} is VALID [2022-02-20 17:29:13,717 INFO L290 TraceCheckUtils]: 13: Hoare triple {197#(<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2)} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {219#(and (= |ULTIMATE.start_main_~x~0#1| 1) (<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:29:13,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {219#(and (= |ULTIMATE.start_main_~x~0#1| 1) (<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} assume !false; {219#(and (= |ULTIMATE.start_main_~x~0#1| 1) (<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} is VALID [2022-02-20 17:29:13,719 INFO L272 TraceCheckUtils]: 15: Hoare triple {219#(and (= |ULTIMATE.start_main_~x~0#1| 1) (<= (mod |ULTIMATE.start_main_~z~0#1| 4294967296) 2) (= |ULTIMATE.start_main_~y~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {226#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:13,719 INFO L290 TraceCheckUtils]: 16: Hoare triple {226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:13,720 INFO L290 TraceCheckUtils]: 17: Hoare triple {230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {173#false} is VALID [2022-02-20 17:29:13,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-02-20 17:29:13,720 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:29:13,721 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:14,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {173#false} assume !false; {173#false} is VALID [2022-02-20 17:29:14,092 INFO L290 TraceCheckUtils]: 17: Hoare triple {230#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {173#false} is VALID [2022-02-20 17:29:14,093 INFO L290 TraceCheckUtils]: 16: Hoare triple {226#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {230#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-02-20 17:29:14,097 INFO L272 TraceCheckUtils]: 15: Hoare triple {246#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} call __VERIFIER_assert((if 0 == 1 + (main_~x~0#1 * (main_~z~0#1 % 4294967296) - main_~x~0#1 - main_~y~0#1) then 1 else 0)); {226#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:14,097 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} assume !false; {246#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:29:14,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {172#true} main_~x~0#1 := 1;main_~y~0#1 := main_~z~0#1 % 4294967296;main_~c~0#1 := 1; {246#(= (+ (* |ULTIMATE.start_main_~x~0#1| (mod |ULTIMATE.start_main_~z~0#1| 4294967296)) 1) (+ |ULTIMATE.start_main_~x~0#1| |ULTIMATE.start_main_~y~0#1|))} is VALID [2022-02-20 17:29:14,098 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {172#true} {172#true} #53#return; {172#true} is VALID [2022-02-20 17:29:14,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:29:14,099 INFO L290 TraceCheckUtils]: 10: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:29:14,099 INFO L290 TraceCheckUtils]: 9: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:29:14,099 INFO L272 TraceCheckUtils]: 8: Hoare triple {172#true} call assume_abort_if_not((if main_~k~0#1 % 4294967296 >= 0 && main_~k~0#1 % 4294967296 <= 2 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:14,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#true} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {172#true} is VALID [2022-02-20 17:29:14,100 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {172#true} {172#true} #51#return; {172#true} is VALID [2022-02-20 17:29:14,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {172#true} assume true; {172#true} is VALID [2022-02-20 17:29:14,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {172#true} assume !(0 == ~cond); {172#true} is VALID [2022-02-20 17:29:14,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {172#true} ~cond := #in~cond; {172#true} is VALID [2022-02-20 17:29:14,101 INFO L272 TraceCheckUtils]: 2: Hoare triple {172#true} call assume_abort_if_not((if main_~z~0#1 % 4294967296 >= 0 && main_~z~0#1 % 4294967296 <= 2 then 1 else 0)); {172#true} is VALID [2022-02-20 17:29:14,101 INFO L290 TraceCheckUtils]: 1: Hoare triple {172#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {172#true} is VALID [2022-02-20 17:29:14,101 INFO L290 TraceCheckUtils]: 0: Hoare triple {172#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3); {172#true} is VALID [2022-02-20 17:29:14,102 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:14,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 17:29:14,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023844339] [2022-02-20 17:29:14,102 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 17:29:14,103 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2002431870] [2022-02-20 17:29:14,103 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2002431870] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:29:14,103 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:29:14,103 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2022-02-20 17:29:14,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683843124] [2022-02-20 17:29:14,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:14,105 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:14,105 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:14,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:14,120 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:14,120 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 17:29:14,120 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:14,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 17:29:14,121 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,753 INFO L93 Difference]: Finished difference Result 27 states and 28 transitions. [2022-02-20 17:29:14,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 17:29:14,753 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:14,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:14,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:29:14,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2022-02-20 17:29:14,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 28 transitions. [2022-02-20 17:29:14,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:14,785 INFO L225 Difference]: With dead ends: 27 [2022-02-20 17:29:14,785 INFO L226 Difference]: Without dead ends: 23 [2022-02-20 17:29:14,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-02-20 17:29:14,787 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 6 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:14,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 17:29:14,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2022-02-20 17:29:14,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2022-02-20 17:29:14,791 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:14,792 INFO L82 GeneralOperation]: Start isEquivalent. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,792 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,792 INFO L87 Difference]: Start difference. First operand 23 states. Second operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,795 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 17:29:14,795 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 17:29:14,795 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,795 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,796 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:29:14,796 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 23 states. [2022-02-20 17:29:14,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:14,798 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2022-02-20 17:29:14,798 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 17:29:14,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:14,798 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:14,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:14,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:14,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.0625) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:14,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2022-02-20 17:29:14,801 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 19 [2022-02-20 17:29:14,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:14,801 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2022-02-20 17:29:14,801 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:14,801 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2022-02-20 17:29:14,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:29:14,802 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:14,802 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:14,827 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:15,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:15,016 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:15,016 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:15,016 INFO L85 PathProgramCache]: Analyzing trace with hash 1670281901, now seen corresponding path program 1 times [2022-02-20 17:29:15,016 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 17:29:15,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325316347] [2022-02-20 17:29:15,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:15,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 17:29:15,031 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 17:29:15,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1869561531] [2022-02-20 17:29:15,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:15,032 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 17:29:15,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:15,033 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 17:29:15,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 17:29:15,073 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:15,073 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:15,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:15,094 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 17:29:15,095 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:15,096 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:15,133 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-02-20 17:29:15,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-02-20 17:29:15,318 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:29:15,321 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:15,331 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if ~z~0 % 4294967296 >= 0 && ~z~0 % 4294967296 <= 2 then 1 else 0)); [2022-02-20 17:29:15,334 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:29:15,338 INFO L158 Benchmark]: Toolchain (without parser) took 3181.23ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 65.6MB in the beginning and 57.0MB in the end (delta: 8.6MB). Peak memory consumption was 29.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,340 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:15,340 INFO L158 Benchmark]: CACSL2BoogieTranslator took 164.62ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 55.1MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,341 INFO L158 Benchmark]: Boogie Procedure Inliner took 26.61ms. Allocated memory is still 94.4MB. Free memory was 55.1MB in the beginning and 53.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,341 INFO L158 Benchmark]: Boogie Preprocessor took 17.21ms. Allocated memory is still 94.4MB. Free memory was 53.5MB in the beginning and 52.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:15,345 INFO L158 Benchmark]: RCFGBuilder took 246.45ms. Allocated memory is still 94.4MB. Free memory was 52.4MB in the beginning and 72.7MB in the end (delta: -20.3MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,345 INFO L158 Benchmark]: TraceAbstraction took 2705.10ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 72.2MB in the beginning and 57.0MB in the end (delta: 15.1MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. [2022-02-20 17:29:15,347 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.18ms. Allocated memory is still 77.6MB. Free memory was 43.9MB in the beginning and 43.9MB in the end (delta: 39.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 164.62ms. Allocated memory is still 94.4MB. Free memory was 65.4MB in the beginning and 55.1MB in the end (delta: 10.3MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 26.61ms. Allocated memory is still 94.4MB. Free memory was 55.1MB in the beginning and 53.5MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 17.21ms. Allocated memory is still 94.4MB. Free memory was 53.5MB in the beginning and 52.5MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 246.45ms. Allocated memory is still 94.4MB. Free memory was 52.4MB in the beginning and 72.7MB in the end (delta: -20.3MB). Peak memory consumption was 13.4MB. Max. memory is 16.1GB. * TraceAbstraction took 2705.10ms. Allocated memory was 94.4MB in the beginning and 113.2MB in the end (delta: 18.9MB). Free memory was 72.2MB in the beginning and 57.0MB in the end (delta: 15.1MB). Peak memory consumption was 35.0MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:29:15,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 83658644ab59c175befe18129a61686a7f8ef5283dc72c7f2a03865a8223d162 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 17:29:17,275 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 17:29:17,276 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 17:29:17,307 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 17:29:17,308 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 17:29:17,311 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 17:29:17,312 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 17:29:17,313 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 17:29:17,315 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 17:29:17,319 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 17:29:17,319 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 17:29:17,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 17:29:17,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 17:29:17,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 17:29:17,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 17:29:17,329 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 17:29:17,332 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 17:29:17,332 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 17:29:17,334 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 17:29:17,336 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 17:29:17,339 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 17:29:17,341 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 17:29:17,342 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 17:29:17,343 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 17:29:17,348 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 17:29:17,350 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 17:29:17,351 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 17:29:17,351 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 17:29:17,352 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 17:29:17,353 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 17:29:17,353 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 17:29:17,354 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 17:29:17,355 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 17:29:17,356 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 17:29:17,357 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 17:29:17,357 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 17:29:17,358 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 17:29:17,358 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 17:29:17,359 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 17:29:17,360 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 17:29:17,361 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 17:29:17,364 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 17:29:17,404 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 17:29:17,404 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 17:29:17,405 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 17:29:17,406 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 17:29:17,406 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 17:29:17,407 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 17:29:17,408 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 17:29:17,409 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 17:29:17,409 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 17:29:17,409 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 17:29:17,410 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 17:29:17,410 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 17:29:17,410 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 17:29:17,411 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 17:29:17,411 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 17:29:17,411 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 17:29:17,411 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 17:29:17,411 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 17:29:17,412 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 17:29:17,412 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 17:29:17,412 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 17:29:17,412 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 17:29:17,412 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 17:29:17,413 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 17:29:17,413 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 17:29:17,413 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 17:29:17,413 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:17,413 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 17:29:17,414 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 17:29:17,414 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 17:29:17,414 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 17:29:17,414 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 17:29:17,414 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 17:29:17,415 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 17:29:17,415 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 17:29:17,415 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 17:29:17,415 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 83658644ab59c175befe18129a61686a7f8ef5283dc72c7f2a03865a8223d162 [2022-02-20 17:29:17,709 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 17:29:17,736 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 17:29:17,738 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 17:29:17,739 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 17:29:17,739 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 17:29:17,741 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c [2022-02-20 17:29:17,788 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b68b4a5a/b85387f64de04ce49b5ff0bc4292429a/FLAG28e55410a [2022-02-20 17:29:18,210 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 17:29:18,211 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c [2022-02-20 17:29:18,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b68b4a5a/b85387f64de04ce49b5ff0bc4292429a/FLAG28e55410a [2022-02-20 17:29:18,633 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7b68b4a5a/b85387f64de04ce49b5ff0bc4292429a [2022-02-20 17:29:18,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 17:29:18,636 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 17:29:18,637 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:18,637 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 17:29:18,640 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 17:29:18,641 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,642 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3b428cd8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18, skipping insertion in model container [2022-02-20 17:29:18,643 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,649 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 17:29:18,663 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 17:29:18,789 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c[555,568] [2022-02-20 17:29:18,847 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:18,858 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 17:29:18,884 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/nla-digbench-scaling/geo1-u_valuebound2.c[555,568] [2022-02-20 17:29:18,894 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 17:29:18,905 INFO L208 MainTranslator]: Completed translation [2022-02-20 17:29:18,905 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18 WrapperNode [2022-02-20 17:29:18,905 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 17:29:18,906 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:18,906 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 17:29:18,907 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 17:29:18,912 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,918 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,933 INFO L137 Inliner]: procedures = 14, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 38 [2022-02-20 17:29:18,933 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 17:29:18,934 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 17:29:18,934 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 17:29:18,934 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 17:29:18,940 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,941 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,943 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,943 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,948 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,951 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,952 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,954 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 17:29:18,954 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 17:29:18,955 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 17:29:18,955 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 17:29:18,958 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (1/1) ... [2022-02-20 17:29:18,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 17:29:18,972 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 17:29:18,984 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 17:29:19,001 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 17:29:19,017 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 17:29:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 17:29:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-02-20 17:29:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-02-20 17:29:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 17:29:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 17:29:19,018 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-02-20 17:29:19,018 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-02-20 17:29:19,076 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 17:29:19,078 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 17:29:19,333 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 17:29:19,338 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 17:29:19,347 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 17:29:19,349 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:19 BoogieIcfgContainer [2022-02-20 17:29:19,349 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 17:29:19,350 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 17:29:19,351 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 17:29:19,353 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 17:29:19,353 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 05:29:18" (1/3) ... [2022-02-20 17:29:19,353 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c648c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:19, skipping insertion in model container [2022-02-20 17:29:19,367 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 05:29:18" (2/3) ... [2022-02-20 17:29:19,367 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c648c96 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 05:29:19, skipping insertion in model container [2022-02-20 17:29:19,368 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 05:29:19" (3/3) ... [2022-02-20 17:29:19,369 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_valuebound2.c [2022-02-20 17:29:19,373 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 17:29:19,373 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 17:29:19,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 17:29:19,447 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 17:29:19,447 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 17:29:19,465 INFO L276 IsEmpty]: Start isEmpty. Operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:19,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:19,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:19,470 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:19,471 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:19,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:19,474 INFO L85 PathProgramCache]: Analyzing trace with hash -1975646755, now seen corresponding path program 1 times [2022-02-20 17:29:19,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:19,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [463930664] [2022-02-20 17:29:19,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:19,485 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:19,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:19,487 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:29:19,488 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 17:29:19,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,569 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 17:29:19,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:19,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:19,706 INFO L290 TraceCheckUtils]: 0: Hoare triple {28#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {28#true} is VALID [2022-02-20 17:29:19,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {28#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {28#true} is VALID [2022-02-20 17:29:19,707 INFO L272 TraceCheckUtils]: 2: Hoare triple {28#true} call assume_abort_if_not((if ~bvuge32(main_~z~0#1, 0bv32) && ~bvule32(main_~z~0#1, 2bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:29:19,708 INFO L290 TraceCheckUtils]: 3: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:19,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {28#true} is VALID [2022-02-20 17:29:19,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#true} assume true; {28#true} is VALID [2022-02-20 17:29:19,709 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {28#true} {28#true} #51#return; {28#true} is VALID [2022-02-20 17:29:19,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#true} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {28#true} is VALID [2022-02-20 17:29:19,711 INFO L272 TraceCheckUtils]: 8: Hoare triple {28#true} call assume_abort_if_not((if ~bvuge32(main_~k~0#1, 0bv32) && ~bvule32(main_~k~0#1, 2bv32) then 1bv32 else 0bv32)); {28#true} is VALID [2022-02-20 17:29:19,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#true} ~cond := #in~cond; {28#true} is VALID [2022-02-20 17:29:19,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#true} assume 0bv32 == ~cond;assume false; {29#false} is VALID [2022-02-20 17:29:19,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {29#false} assume true; {29#false} is VALID [2022-02-20 17:29:19,713 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {29#false} {28#true} #53#return; {29#false} is VALID [2022-02-20 17:29:19,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {29#false} main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {29#false} is VALID [2022-02-20 17:29:19,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:19,714 INFO L272 TraceCheckUtils]: 15: Hoare triple {29#false} call __VERIFIER_assert((if 0bv64 == ~bvadd64(1bv64, ~bvsub64(~bvsub64(~bvmul64(main_~x~0#1, ~zero_extendFrom32To64(main_~z~0#1)), main_~x~0#1), main_~y~0#1)) then 1bv32 else 0bv32)); {29#false} is VALID [2022-02-20 17:29:19,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {29#false} ~cond := #in~cond; {29#false} is VALID [2022-02-20 17:29:19,714 INFO L290 TraceCheckUtils]: 17: Hoare triple {29#false} assume 0bv32 == ~cond; {29#false} is VALID [2022-02-20 17:29:19,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {29#false} assume !false; {29#false} is VALID [2022-02-20 17:29:19,716 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 17:29:19,716 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 17:29:19,717 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:19,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [463930664] [2022-02-20 17:29:19,718 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [463930664] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 17:29:19,718 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 17:29:19,718 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 17:29:19,720 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819801474] [2022-02-20 17:29:19,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:19,725 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:19,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:19,730 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:19,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:19,786 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 17:29:19,786 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:19,812 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 17:29:19,818 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:19,820 INFO L87 Difference]: Start difference. First operand has 25 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:20,065 INFO L93 Difference]: Finished difference Result 47 states and 62 transitions. [2022-02-20 17:29:20,065 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 17:29:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 17:29:20,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 17:29:20,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:20,331 INFO L225 Difference]: With dead ends: 47 [2022-02-20 17:29:20,331 INFO L226 Difference]: Without dead ends: 21 [2022-02-20 17:29:20,333 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 17:29:20,336 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 27 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:20,336 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 17:29:20,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-02-20 17:29:20,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-02-20 17:29:20,359 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:20,360 INFO L82 GeneralOperation]: Start isEquivalent. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:20,361 INFO L74 IsIncluded]: Start isIncluded. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:20,361 INFO L87 Difference]: Start difference. First operand 21 states. Second operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:20,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:20,364 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:20,364 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:20,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:20,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:20,366 INFO L74 IsIncluded]: Start isIncluded. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:20,366 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 21 states. [2022-02-20 17:29:20,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:20,369 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2022-02-20 17:29:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:20,369 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:20,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:20,370 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:20,370 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:20,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 17:29:20,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2022-02-20 17:29:20,373 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 19 [2022-02-20 17:29:20,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:20,374 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2022-02-20 17:29:20,374 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:20,374 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2022-02-20 17:29:20,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 17:29:20,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:20,375 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:20,396 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:20,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:20,588 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:20,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:20,589 INFO L85 PathProgramCache]: Analyzing trace with hash 1719515233, now seen corresponding path program 1 times [2022-02-20 17:29:20,589 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:20,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [885004867] [2022-02-20 17:29:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:20,590 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:20,590 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:20,592 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:29:20,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 17:29:20,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:20,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 17:29:20,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 17:29:20,655 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 17:29:21,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {218#true} is VALID [2022-02-20 17:29:21,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {218#true} is VALID [2022-02-20 17:29:21,007 INFO L272 TraceCheckUtils]: 2: Hoare triple {218#true} call assume_abort_if_not((if ~bvuge32(main_~z~0#1, 0bv32) && ~bvule32(main_~z~0#1, 2bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:21,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {218#true} ~cond := #in~cond; {232#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} is VALID [2022-02-20 17:29:21,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {232#(= |assume_abort_if_not_#in~cond| assume_abort_if_not_~cond)} assume !(0bv32 == ~cond); {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:29:21,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} assume true; {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:29:21,009 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {236#(not (= |assume_abort_if_not_#in~cond| (_ bv0 32)))} {218#true} #51#return; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32))} is VALID [2022-02-20 17:29:21,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32))} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32))} is VALID [2022-02-20 17:29:21,010 INFO L272 TraceCheckUtils]: 8: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32))} call assume_abort_if_not((if ~bvuge32(main_~k~0#1, 0bv32) && ~bvule32(main_~k~0#1, 2bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:21,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:21,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:21,011 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:21,011 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {218#true} {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32))} #53#return; {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32))} is VALID [2022-02-20 17:29:21,012 INFO L290 TraceCheckUtils]: 13: Hoare triple {243#(bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32))} main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:21,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} assume !false; {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} is VALID [2022-02-20 17:29:21,014 INFO L272 TraceCheckUtils]: 15: Hoare triple {265#(and (= |ULTIMATE.start_main_~x~0#1| (_ bv1 64)) (bvule |ULTIMATE.start_main_~z~0#1| (_ bv2 32)) (= |ULTIMATE.start_main_~y~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)))} call __VERIFIER_assert((if 0bv64 == ~bvadd64(1bv64, ~bvsub64(~bvsub64(~bvmul64(main_~x~0#1, ~zero_extendFrom32To64(main_~z~0#1)), main_~x~0#1), main_~y~0#1)) then 1bv32 else 0bv32)); {272#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} is VALID [2022-02-20 17:29:21,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {272#(= (_ bv1 32) |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {276#(= __VERIFIER_assert_~cond (_ bv1 32))} is VALID [2022-02-20 17:29:21,015 INFO L290 TraceCheckUtils]: 17: Hoare triple {276#(= __VERIFIER_assert_~cond (_ bv1 32))} assume 0bv32 == ~cond; {219#false} is VALID [2022-02-20 17:29:21,015 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:29:21,015 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 17:29:21,015 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 17:29:22,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {219#false} assume !false; {219#false} is VALID [2022-02-20 17:29:22,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {286#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} assume 0bv32 == ~cond; {219#false} is VALID [2022-02-20 17:29:22,125 INFO L290 TraceCheckUtils]: 16: Hoare triple {290#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} ~cond := #in~cond; {286#(not (= __VERIFIER_assert_~cond (_ bv0 32)))} is VALID [2022-02-20 17:29:22,126 INFO L272 TraceCheckUtils]: 15: Hoare triple {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~0#1|)))} call __VERIFIER_assert((if 0bv64 == ~bvadd64(1bv64, ~bvsub64(~bvsub64(~bvmul64(main_~x~0#1, ~zero_extendFrom32To64(main_~z~0#1)), main_~x~0#1), main_~y~0#1)) then 1bv32 else 0bv32)); {290#(not (= |__VERIFIER_assert_#in~cond| (_ bv0 32)))} is VALID [2022-02-20 17:29:22,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~0#1|)))} assume !false; {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:22,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {218#true} main_~x~0#1 := 1bv64;main_~y~0#1 := ~zero_extendFrom32To64(main_~z~0#1);main_~c~0#1 := 1bv64; {294#(= (_ bv0 64) (bvadd (_ bv1 64) (bvneg |ULTIMATE.start_main_~x~0#1|) (bvmul |ULTIMATE.start_main_~x~0#1| ((_ zero_extend 32) |ULTIMATE.start_main_~z~0#1|)) (bvneg |ULTIMATE.start_main_~y~0#1|)))} is VALID [2022-02-20 17:29:22,127 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {218#true} {218#true} #53#return; {218#true} is VALID [2022-02-20 17:29:22,128 INFO L290 TraceCheckUtils]: 11: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:22,128 INFO L290 TraceCheckUtils]: 10: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:22,128 INFO L290 TraceCheckUtils]: 9: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:22,128 INFO L272 TraceCheckUtils]: 8: Hoare triple {218#true} call assume_abort_if_not((if ~bvuge32(main_~k~0#1, 0bv32) && ~bvule32(main_~k~0#1, 2bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:22,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {218#true} main_~k~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1; {218#true} is VALID [2022-02-20 17:29:22,129 INFO L284 TraceCheckUtils]: 6: Hoare quadruple {218#true} {218#true} #51#return; {218#true} is VALID [2022-02-20 17:29:22,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {218#true} assume true; {218#true} is VALID [2022-02-20 17:29:22,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {218#true} assume !(0bv32 == ~cond); {218#true} is VALID [2022-02-20 17:29:22,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {218#true} ~cond := #in~cond; {218#true} is VALID [2022-02-20 17:29:22,130 INFO L272 TraceCheckUtils]: 2: Hoare triple {218#true} call assume_abort_if_not((if ~bvuge32(main_~z~0#1, 0bv32) && ~bvule32(main_~z~0#1, 2bv32) then 1bv32 else 0bv32)); {218#true} is VALID [2022-02-20 17:29:22,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {218#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_~z~0#1, main_~k~0#1, main_~x~0#1, main_~y~0#1, main_~c~0#1;havoc main_~z~0#1;havoc main_~k~0#1;havoc main_~x~0#1;havoc main_~y~0#1;havoc main_~c~0#1;main_~z~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {218#true} is VALID [2022-02-20 17:29:22,130 INFO L290 TraceCheckUtils]: 0: Hoare triple {218#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(9bv32, 2bv32);call #Ultimate.allocInit(12bv32, 3bv32); {218#true} is VALID [2022-02-20 17:29:22,130 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 17:29:22,130 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 17:29:22,131 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [885004867] [2022-02-20 17:29:22,131 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [885004867] provided 1 perfect and 1 imperfect interpolant sequences [2022-02-20 17:29:22,131 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 17:29:22,131 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 11 [2022-02-20 17:29:22,131 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804801495] [2022-02-20 17:29:22,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 17:29:22,133 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:22,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 17:29:22,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:22,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:22,200 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 17:29:22,200 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 17:29:22,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 17:29:22,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 17:29:22,201 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:25,704 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [] [2022-02-20 17:29:27,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:27,929 INFO L93 Difference]: Finished difference Result 31 states and 34 transitions. [2022-02-20 17:29:27,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 17:29:27,929 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-02-20 17:29:27,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 17:29:27,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:27,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:29:27,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:27,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 34 transitions. [2022-02-20 17:29:27,933 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 34 transitions. [2022-02-20 17:29:28,208 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 17:29:28,210 INFO L225 Difference]: With dead ends: 31 [2022-02-20 17:29:28,210 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 17:29:28,211 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2022-02-20 17:29:28,212 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.2s IncrementalHoareTripleChecker+Time [2022-02-20 17:29:28,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 71 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 1 Unknown, 0 Unchecked, 3.2s Time] [2022-02-20 17:29:28,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 17:29:28,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2022-02-20 17:29:28,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 17:29:28,217 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:28,218 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:28,218 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:28,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:28,220 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:28,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:28,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:28,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:29:28,222 INFO L87 Difference]: Start difference. First operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-02-20 17:29:28,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 17:29:28,224 INFO L93 Difference]: Finished difference Result 29 states and 32 transitions. [2022-02-20 17:29:28,224 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-02-20 17:29:28,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 17:29:28,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 17:29:28,225 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 17:29:28,225 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 17:29:28,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 20 states have internal predecessors, (20), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 17:29:28,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 29 transitions. [2022-02-20 17:29:28,228 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 29 transitions. Word has length 19 [2022-02-20 17:29:28,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 17:29:28,228 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 29 transitions. [2022-02-20 17:29:28,228 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 17:29:28,229 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 29 transitions. [2022-02-20 17:29:28,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 17:29:28,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 17:29:28,230 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 17:29:28,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 17:29:28,441 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:28,442 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 17:29:28,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 17:29:28,442 INFO L85 PathProgramCache]: Analyzing trace with hash 1670281901, now seen corresponding path program 1 times [2022-02-20 17:29:28,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 17:29:28,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178805227] [2022-02-20 17:29:28,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 17:29:28,444 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 17:29:28,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 17:29:28,446 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 17:29:28,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 17:29:28,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:28,504 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 17:29:28,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 17:29:28,583 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 17:29:28,583 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 17:29:28,584 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 17:29:28,600 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 17:29:28,786 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 17:29:28,789 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1] [2022-02-20 17:29:28,791 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 17:29:28,804 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call assume_abort_if_not((if ~bvuge32(~z~0, 0bv32) && ~bvule32(~z~0, 2bv32) then 1bv32 else 0bv32)); [2022-02-20 17:29:28,811 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 17:29:28,816 INFO L158 Benchmark]: Toolchain (without parser) took 10179.83ms. Allocated memory was 54.5MB in the beginning and 88.1MB in the end (delta: 33.6MB). Free memory was 31.2MB in the beginning and 54.8MB in the end (delta: -23.7MB). Peak memory consumption was 9.6MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,819 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:28,819 INFO L158 Benchmark]: CACSL2BoogieTranslator took 268.47ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.0MB in the beginning and 55.6MB in the end (delta: -24.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,820 INFO L158 Benchmark]: Boogie Procedure Inliner took 27.31ms. Allocated memory is still 73.4MB. Free memory was 55.4MB in the beginning and 53.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,820 INFO L158 Benchmark]: Boogie Preprocessor took 19.59ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 52.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 17:29:28,820 INFO L158 Benchmark]: RCFGBuilder took 394.82ms. Allocated memory is still 73.4MB. Free memory was 52.6MB in the beginning and 42.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,823 INFO L158 Benchmark]: TraceAbstraction took 9464.82ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 42.1MB in the beginning and 54.8MB in the end (delta: -12.7MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. [2022-02-20 17:29:28,825 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21ms. Allocated memory is still 54.5MB. Free memory was 35.9MB in the beginning and 35.9MB in the end (delta: 40.1kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 268.47ms. Allocated memory was 54.5MB in the beginning and 73.4MB in the end (delta: 18.9MB). Free memory was 31.0MB in the beginning and 55.6MB in the end (delta: -24.6MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 27.31ms. Allocated memory is still 73.4MB. Free memory was 55.4MB in the beginning and 53.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 19.59ms. Allocated memory is still 73.4MB. Free memory was 53.9MB in the beginning and 52.6MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 394.82ms. Allocated memory is still 73.4MB. Free memory was 52.6MB in the beginning and 42.5MB in the end (delta: 10.1MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * TraceAbstraction took 9464.82ms. Allocated memory was 73.4MB in the beginning and 88.1MB in the end (delta: 14.7MB). Free memory was 42.1MB in the beginning and 54.8MB in the end (delta: -12.7MB). Peak memory consumption was 4.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 17:29:28,873 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator