/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 15:30:45,111 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 15:30:45,114 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 15:30:45,177 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 15:30:45,178 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 15:30:45,179 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 15:30:45,183 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 15:30:45,186 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 15:30:45,187 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 15:30:45,192 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 15:30:45,193 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 15:30:45,195 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 15:30:45,195 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 15:30:45,197 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 15:30:45,199 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 15:30:45,202 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 15:30:45,203 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 15:30:45,203 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 15:30:45,206 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 15:30:45,211 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 15:30:45,214 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 15:30:45,215 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 15:30:45,216 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 15:30:45,216 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 15:30:45,218 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 15:30:45,225 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 15:30:45,225 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 15:30:45,225 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 15:30:45,226 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 15:30:45,226 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 15:30:45,228 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 15:30:45,229 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 15:30:45,230 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 15:30:45,231 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 15:30:45,232 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 15:30:45,232 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 15:30:45,233 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 15:30:45,233 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 15:30:45,234 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 15:30:45,234 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 15:30:45,234 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 15:30:45,236 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 15:30:45,237 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2022-04-14 15:30:45,267 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 15:30:45,268 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 15:30:45,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 15:30:45,269 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 15:30:45,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 15:30:45,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 15:30:45,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 15:30:45,270 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 15:30:45,270 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 15:30:45,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 15:30:45,271 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 15:30:45,271 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 15:30:45,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 15:30:45,272 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 15:30:45,272 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 15:30:45,272 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 15:30:45,272 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 15:30:45,273 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 15:30:45,273 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 15:30:45,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 15:30:45,274 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 15:30:45,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 15:30:45,274 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 15:30:45,274 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 15:30:45,274 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:30:45,274 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 15:30:45,275 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 15:30:45,275 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 15:30:45,275 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 15:30:45,275 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 15:30:45,275 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 15:30:45,276 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 15:30:45,276 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 15:30:45,276 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-14 15:30:45,545 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 15:30:45,577 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 15:30:45,579 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 15:30:45,581 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 15:30:45,581 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 15:30:45,583 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2022-04-14 15:30:45,655 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54ab270/080a196700904f69ae7f20e8aeb830d4/FLAG2e5c79570 [2022-04-14 15:30:46,110 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 15:30:46,111 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i [2022-04-14 15:30:46,140 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54ab270/080a196700904f69ae7f20e8aeb830d4/FLAG2e5c79570 [2022-04-14 15:30:46,499 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9a54ab270/080a196700904f69ae7f20e8aeb830d4 [2022-04-14 15:30:46,501 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 15:30:46,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 15:30:46,506 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 15:30:46,506 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 15:30:46,509 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 15:30:46,510 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,515 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5da2b536 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46, skipping insertion in model container [2022-04-14 15:30:46,515 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,522 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 15:30:46,538 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 15:30:46,699 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i[951,964] [2022-04-14 15:30:46,714 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:30:46,723 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 15:30:46,734 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/divbin2_valuebound1.i[951,964] [2022-04-14 15:30:46,740 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 15:30:46,753 INFO L208 MainTranslator]: Completed translation [2022-04-14 15:30:46,753 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46 WrapperNode [2022-04-14 15:30:46,754 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 15:30:46,754 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 15:30:46,755 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 15:30:46,755 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 15:30:46,764 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,770 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,770 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,776 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,781 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,782 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,784 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 15:30:46,785 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 15:30:46,785 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 15:30:46,785 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 15:30:46,788 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (1/1) ... [2022-04-14 15:30:46,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 15:30:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:30:46,825 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-04-14 15:30:46,840 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-04-14 15:30:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 15:30:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 15:30:46,872 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 15:30:46,873 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 15:30:46,874 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 15:30:46,875 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_perror_fail [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure __assert [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 15:30:46,875 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 15:30:46,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 15:30:46,947 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 15:30:46,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 15:30:47,090 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 15:30:47,097 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 15:30:47,098 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-14 15:30:47,099 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:30:47 BoogieIcfgContainer [2022-04-14 15:30:47,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 15:30:47,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 15:30:47,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 15:30:47,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 15:30:47,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 03:30:46" (1/3) ... [2022-04-14 15:30:47,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9659cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:30:47, skipping insertion in model container [2022-04-14 15:30:47,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 03:30:46" (2/3) ... [2022-04-14 15:30:47,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b9659cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 03:30:47, skipping insertion in model container [2022-04-14 15:30:47,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 03:30:47" (3/3) ... [2022-04-14 15:30:47,120 INFO L111 eAbstractionObserver]: Analyzing ICFG divbin2_valuebound1.i [2022-04-14 15:30:47,125 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 15:30:47,125 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 15:30:47,173 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 15:30:47,179 INFO L340 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 [2022-04-14 15:30:47,179 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 15:30:47,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 15:30:47,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-14 15:30:47,216 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:30:47,217 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:30:47,217 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:30:47,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:30:47,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1171333446, now seen corresponding path program 1 times [2022-04-14 15:30:47,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:30:47,239 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626949123] [2022-04-14 15:30:47,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:47,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:30:47,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:47,437 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 15:30:47,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:47,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2); {33#true} is VALID [2022-04-14 15:30:47,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-14 15:30:47,469 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-14 15:30:47,470 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-14 15:30:47,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:47,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-14 15:30:47,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 15:30:47,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 15:30:47,494 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-14 15:30:47,496 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 15:30:47,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {42#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #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(10, 2); {33#true} is VALID [2022-04-14 15:30:47,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-14 15:30:47,497 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #84#return; {33#true} is VALID [2022-04-14 15:30:47,497 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret2 := main(); {33#true} is VALID [2022-04-14 15:30:47,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {33#true} is VALID [2022-04-14 15:30:47,498 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {33#true} is VALID [2022-04-14 15:30:47,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-14 15:30:47,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-14 15:30:47,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-14 15:30:47,499 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {34#false} {33#true} #78#return; {34#false} is VALID [2022-04-14 15:30:47,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {34#false} is VALID [2022-04-14 15:30:47,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-14 15:30:47,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-14 15:30:47,501 INFO L272 TraceCheckUtils]: 14: Hoare triple {34#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {34#false} is VALID [2022-04-14 15:30:47,501 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-14 15:30:47,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-14 15:30:47,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-14 15:30:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:30:47,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:30:47,503 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626949123] [2022-04-14 15:30:47,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626949123] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:30:47,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:30:47,505 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:30:47,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2439453] [2022-04-14 15:30:47,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:30:47,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 15:30:47,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:30:47,520 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:47,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:47,559 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:30:47,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:30:47,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:30:47,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:30:47,590 INFO L87 Difference]: Start difference. First operand has 30 states, 19 states have (on average 1.5263157894736843) internal successors, (29), 20 states have internal predecessors, (29), 5 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:47,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:47,738 INFO L93 Difference]: Finished difference Result 51 states and 70 transitions. [2022-04-14 15:30:47,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:30:47,738 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-14 15:30:47,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:30:47,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:47,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-14 15:30:47,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:47,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 70 transitions. [2022-04-14 15:30:47,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 70 transitions. [2022-04-14 15:30:47,833 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:47,848 INFO L225 Difference]: With dead ends: 51 [2022-04-14 15:30:47,848 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 15:30:47,852 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:30:47,856 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 20 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:30:47,858 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 33 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:30:47,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 15:30:47,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 15:30:47,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:30:47,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 15:30:47,888 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 15:30:47,889 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 15:30:47,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:47,893 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-14 15:30:47,893 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-14 15:30:47,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:47,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:47,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 15:30:47,894 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 15:30:47,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:47,897 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2022-04-14 15:30:47,898 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-14 15:30:47,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:47,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:47,898 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:30:47,898 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:30:47,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 17 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 15:30:47,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-14 15:30:47,917 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 18 [2022-04-14 15:30:47,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:30:47,918 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-14 15:30:47,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 2 states have internal predecessors, (12), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:47,919 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-14 15:30:47,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 15:30:47,919 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:30:47,920 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:30:47,920 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 15:30:47,920 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:30:47,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:30:47,921 INFO L85 PathProgramCache]: Analyzing trace with hash -73515422, now seen corresponding path program 1 times [2022-04-14 15:30:47,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:30:47,921 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1669693368] [2022-04-14 15:30:47,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:47,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:30:47,962 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:30:47,962 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [75604855] [2022-04-14 15:30:47,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:47,962 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:30:47,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:30:47,979 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-04-14 15:30:48,009 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-04-14 15:30:48,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:48,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 15:30:48,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:48,073 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:30:48,486 INFO L272 TraceCheckUtils]: 0: Hoare triple {195#true} call ULTIMATE.init(); {195#true} is VALID [2022-04-14 15:30:48,486 INFO L290 TraceCheckUtils]: 1: Hoare triple {195#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(10, 2); {195#true} is VALID [2022-04-14 15:30:48,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {195#true} assume true; {195#true} is VALID [2022-04-14 15:30:48,487 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {195#true} {195#true} #84#return; {195#true} is VALID [2022-04-14 15:30:48,487 INFO L272 TraceCheckUtils]: 4: Hoare triple {195#true} call #t~ret2 := main(); {195#true} is VALID [2022-04-14 15:30:48,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {195#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {195#true} is VALID [2022-04-14 15:30:48,487 INFO L272 TraceCheckUtils]: 6: Hoare triple {195#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {195#true} is VALID [2022-04-14 15:30:48,488 INFO L290 TraceCheckUtils]: 7: Hoare triple {195#true} ~cond := #in~cond; {221#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:30:48,489 INFO L290 TraceCheckUtils]: 8: Hoare triple {221#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {225#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:30:48,489 INFO L290 TraceCheckUtils]: 9: Hoare triple {225#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {225#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:30:48,490 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {225#(not (= |assume_abort_if_not_#in~cond| 0))} {195#true} #78#return; {232#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-14 15:30:48,491 INFO L290 TraceCheckUtils]: 11: Hoare triple {232#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {236#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-14 15:30:48,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {236#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {236#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-14 15:30:48,493 INFO L290 TraceCheckUtils]: 13: Hoare triple {236#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {243#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 15:30:48,493 INFO L290 TraceCheckUtils]: 14: Hoare triple {243#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} assume !false; {243#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 15:30:48,494 INFO L272 TraceCheckUtils]: 15: Hoare triple {243#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (< (mod main_~r~0 4294967296) (mod main_~b~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {250#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:30:48,495 INFO L290 TraceCheckUtils]: 16: Hoare triple {250#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {254#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:30:48,495 INFO L290 TraceCheckUtils]: 17: Hoare triple {254#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {196#false} is VALID [2022-04-14 15:30:48,496 INFO L290 TraceCheckUtils]: 18: Hoare triple {196#false} assume !false; {196#false} is VALID [2022-04-14 15:30:48,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:30:48,496 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:30:48,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:30:48,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1669693368] [2022-04-14 15:30:48,497 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:30:48,497 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [75604855] [2022-04-14 15:30:48,497 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [75604855] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:30:48,497 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:30:48,498 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-14 15:30:48,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496539015] [2022-04-14 15:30:48,499 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:30:48,499 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-14 15:30:48,500 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:30:48,500 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:48,519 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:48,520 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:30:48,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:30:48,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:30:48,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:30:48,521 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:48,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:48,907 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2022-04-14 15:30:48,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-14 15:30:48,908 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19 [2022-04-14 15:30:48,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:30:48,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:48,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-14 15:30:48,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:48,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 42 transitions. [2022-04-14 15:30:48,913 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 42 transitions. [2022-04-14 15:30:48,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:48,989 INFO L225 Difference]: With dead ends: 37 [2022-04-14 15:30:48,989 INFO L226 Difference]: Without dead ends: 34 [2022-04-14 15:30:48,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:30:48,990 INFO L913 BasicCegarLoop]: 19 mSDtfsCounter, 21 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-14 15:30:48,991 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 104 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-14 15:30:48,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-14 15:30:49,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-14 15:30:49,016 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:30:49,016 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:49,017 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:49,017 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:49,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:49,020 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 15:30:49,020 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 15:30:49,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:49,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:49,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-14 15:30:49,021 INFO L87 Difference]: Start difference. First operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 34 states. [2022-04-14 15:30:49,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:49,024 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-14 15:30:49,024 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 15:30:49,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:49,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:49,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:30:49,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:30:49,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 23 states have (on average 1.2173913043478262) internal successors, (28), 24 states have internal predecessors, (28), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:49,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2022-04-14 15:30:49,027 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 19 [2022-04-14 15:30:49,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:30:49,028 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2022-04-14 15:30:49,028 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 7 states have internal predecessors, (13), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:49,028 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2022-04-14 15:30:49,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-14 15:30:49,029 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:30:49,029 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:30:49,055 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-04-14 15:30:49,246 WARN L460 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-04-14 15:30:49,247 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:30:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:30:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1211706883, now seen corresponding path program 1 times [2022-04-14 15:30:49,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:30:49,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042696535] [2022-04-14 15:30:49,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:49,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:30:49,264 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:30:49,265 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890651567] [2022-04-14 15:30:49,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:49,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:30:49,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:30:49,266 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-04-14 15:30:49,270 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-04-14 15:30:49,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:49,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-14 15:30:49,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:49,336 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:30:49,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2022-04-14 15:30:49,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#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(10, 2); {430#true} is VALID [2022-04-14 15:30:49,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-14 15:30:49,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} #84#return; {430#true} is VALID [2022-04-14 15:30:49,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} call #t~ret2 := main(); {430#true} is VALID [2022-04-14 15:30:49,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {430#true} is VALID [2022-04-14 15:30:49,930 INFO L272 TraceCheckUtils]: 6: Hoare triple {430#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {430#true} is VALID [2022-04-14 15:30:49,936 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#true} ~cond := #in~cond; {456#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-14 15:30:49,936 INFO L290 TraceCheckUtils]: 8: Hoare triple {456#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {460#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:30:49,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {460#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {460#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-14 15:30:49,937 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {460#(not (= |assume_abort_if_not_#in~cond| 0))} {430#true} #78#return; {467#(<= (mod main_~A~0 4294967296) 1)} is VALID [2022-04-14 15:30:49,940 INFO L290 TraceCheckUtils]: 11: Hoare triple {467#(<= (mod main_~A~0 4294967296) 1)} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {471#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-14 15:30:49,942 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !false; {471#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} is VALID [2022-04-14 15:30:49,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#(and (= main_~b~0 1) (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (= main_~q~0 0))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 15:30:49,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 15:30:49,944 INFO L290 TraceCheckUtils]: 15: Hoare triple {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 15:30:49,945 INFO L290 TraceCheckUtils]: 16: Hoare triple {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} assume !false; {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} is VALID [2022-04-14 15:30:49,946 INFO L272 TraceCheckUtils]: 17: Hoare triple {478#(and (= main_~A~0 main_~r~0) (<= (mod main_~A~0 4294967296) 1) (<= 1 (mod main_~r~0 4294967296)) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {491#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:30:49,946 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {495#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:30:49,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {495#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {431#false} is VALID [2022-04-14 15:30:49,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-04-14 15:30:49,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:30:49,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:30:50,600 INFO L290 TraceCheckUtils]: 20: Hoare triple {431#false} assume !false; {431#false} is VALID [2022-04-14 15:30:50,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {495#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {431#false} is VALID [2022-04-14 15:30:50,602 INFO L290 TraceCheckUtils]: 18: Hoare triple {491#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {495#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:30:50,603 INFO L272 TraceCheckUtils]: 17: Hoare triple {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {491#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 15:30:50,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:30:50,605 INFO L290 TraceCheckUtils]: 15: Hoare triple {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:30:50,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} assume !false; {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:30:50,607 INFO L290 TraceCheckUtils]: 13: Hoare triple {524#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {511#(forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296)))} is VALID [2022-04-14 15:30:50,608 INFO L290 TraceCheckUtils]: 12: Hoare triple {524#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} assume !false; {524#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-14 15:30:50,609 INFO L290 TraceCheckUtils]: 11: Hoare triple {430#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {524#(or (not (<= (mod main_~b~0 4294967296) (mod main_~r~0 4294967296))) (forall ((main_~b~0 Int)) (= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))))} is VALID [2022-04-14 15:30:50,609 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {430#true} {430#true} #78#return; {430#true} is VALID [2022-04-14 15:30:50,609 INFO L290 TraceCheckUtils]: 9: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-14 15:30:50,609 INFO L290 TraceCheckUtils]: 8: Hoare triple {430#true} assume !(0 == ~cond); {430#true} is VALID [2022-04-14 15:30:50,609 INFO L290 TraceCheckUtils]: 7: Hoare triple {430#true} ~cond := #in~cond; {430#true} is VALID [2022-04-14 15:30:50,610 INFO L272 TraceCheckUtils]: 6: Hoare triple {430#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {430#true} is VALID [2022-04-14 15:30:50,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {430#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {430#true} is VALID [2022-04-14 15:30:50,610 INFO L272 TraceCheckUtils]: 4: Hoare triple {430#true} call #t~ret2 := main(); {430#true} is VALID [2022-04-14 15:30:50,610 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {430#true} {430#true} #84#return; {430#true} is VALID [2022-04-14 15:30:50,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {430#true} assume true; {430#true} is VALID [2022-04-14 15:30:50,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {430#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(10, 2); {430#true} is VALID [2022-04-14 15:30:50,611 INFO L272 TraceCheckUtils]: 0: Hoare triple {430#true} call ULTIMATE.init(); {430#true} is VALID [2022-04-14 15:30:50,611 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:30:50,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:30:50,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042696535] [2022-04-14 15:30:50,612 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:30:50,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890651567] [2022-04-14 15:30:50,612 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890651567] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-14 15:30:50,612 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-14 15:30:50,612 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 11 [2022-04-14 15:30:50,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179467391] [2022-04-14 15:30:50,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:30:50,614 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 15:30:50,614 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:30:50,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:52,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 20 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:52,656 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-14 15:30:52,656 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:30:52,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-14 15:30:52,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:30:52,657 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:52,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:52,805 INFO L93 Difference]: Finished difference Result 42 states and 46 transitions. [2022-04-14 15:30:52,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-14 15:30:52,805 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 21 [2022-04-14 15:30:52,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:30:52,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:52,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 15:30:52,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:52,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 39 transitions. [2022-04-14 15:30:52,810 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 39 transitions. [2022-04-14 15:30:54,857 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 38 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:54,859 INFO L225 Difference]: With dead ends: 42 [2022-04-14 15:30:54,860 INFO L226 Difference]: Without dead ends: 40 [2022-04-14 15:30:54,860 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-04-14 15:30:54,861 INFO L913 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 25 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:30:54,862 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 116 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 25 Unchecked, 0.0s Time] [2022-04-14 15:30:54,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-14 15:30:54,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2022-04-14 15:30:54,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:30:54,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 15:30:54,876 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 15:30:54,877 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 15:30:54,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:54,879 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-14 15:30:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-14 15:30:54,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:54,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:54,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-14 15:30:54,881 INFO L87 Difference]: Start difference. First operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-14 15:30:54,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:54,884 INFO L93 Difference]: Finished difference Result 40 states and 44 transitions. [2022-04-14 15:30:54,884 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-14 15:30:54,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:54,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:54,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:30:54,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:30:54,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 29 states have internal predecessors, (32), 7 states have call successors, (7), 6 states have call predecessors, (7), 5 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-14 15:30:54,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-04-14 15:30:54,888 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 21 [2022-04-14 15:30:54,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:30:54,889 INFO L478 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-04-14 15:30:54,889 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 states have internal predecessors, (15), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-14 15:30:54,889 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-04-14 15:30:54,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 15:30:54,890 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:30:54,890 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:30:54,919 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-04-14 15:30:55,111 WARN L460 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-04-14 15:30:55,112 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:30:55,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:30:55,112 INFO L85 PathProgramCache]: Analyzing trace with hash 947727214, now seen corresponding path program 1 times [2022-04-14 15:30:55,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:30:55,113 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [735905328] [2022-04-14 15:30:55,113 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:55,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:30:55,132 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:30:55,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2048369031] [2022-04-14 15:30:55,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:55,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:30:55,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:30:55,138 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:30:55,157 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-14 15:30:55,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:55,185 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 15:30:55,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:55,195 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:30:55,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {760#true} call ULTIMATE.init(); {760#true} is VALID [2022-04-14 15:30:55,319 INFO L290 TraceCheckUtils]: 1: Hoare triple {760#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(10, 2); {760#true} is VALID [2022-04-14 15:30:55,319 INFO L290 TraceCheckUtils]: 2: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-14 15:30:55,319 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {760#true} {760#true} #84#return; {760#true} is VALID [2022-04-14 15:30:55,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {760#true} call #t~ret2 := main(); {760#true} is VALID [2022-04-14 15:30:55,320 INFO L290 TraceCheckUtils]: 5: Hoare triple {760#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {760#true} is VALID [2022-04-14 15:30:55,320 INFO L272 TraceCheckUtils]: 6: Hoare triple {760#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {760#true} is VALID [2022-04-14 15:30:55,320 INFO L290 TraceCheckUtils]: 7: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-14 15:30:55,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-14 15:30:55,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-14 15:30:55,321 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {760#true} {760#true} #78#return; {760#true} is VALID [2022-04-14 15:30:55,321 INFO L290 TraceCheckUtils]: 11: Hoare triple {760#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 15:30:55,322 INFO L290 TraceCheckUtils]: 12: Hoare triple {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 15:30:55,322 INFO L290 TraceCheckUtils]: 13: Hoare triple {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 15:30:55,323 INFO L290 TraceCheckUtils]: 14: Hoare triple {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !false; {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 15:30:55,323 INFO L272 TraceCheckUtils]: 15: Hoare triple {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {760#true} is VALID [2022-04-14 15:30:55,323 INFO L290 TraceCheckUtils]: 16: Hoare triple {760#true} ~cond := #in~cond; {760#true} is VALID [2022-04-14 15:30:55,324 INFO L290 TraceCheckUtils]: 17: Hoare triple {760#true} assume !(0 == ~cond); {760#true} is VALID [2022-04-14 15:30:55,324 INFO L290 TraceCheckUtils]: 18: Hoare triple {760#true} assume true; {760#true} is VALID [2022-04-14 15:30:55,327 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {760#true} {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} #80#return; {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} is VALID [2022-04-14 15:30:55,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {798#(and (= main_~B~0 main_~b~0) (= main_~B~0 1))} assume !!(~b~0 % 4294967296 != ~B~0 % 4294967296);~q~0 := 2 * ~q~0;~b~0 := (if ~b~0 % 4294967296 < 0 && 0 != ~b~0 % 4294967296 % 2 then 1 + ~b~0 % 4294967296 / 2 else ~b~0 % 4294967296 / 2); {761#false} is VALID [2022-04-14 15:30:55,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {761#false} assume ~r~0 % 4294967296 >= ~b~0 % 4294967296;~q~0 := 1 + ~q~0;~r~0 := ~r~0 - ~b~0; {761#false} is VALID [2022-04-14 15:30:55,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-14 15:30:55,329 INFO L272 TraceCheckUtils]: 23: Hoare triple {761#false} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {761#false} is VALID [2022-04-14 15:30:55,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {761#false} ~cond := #in~cond; {761#false} is VALID [2022-04-14 15:30:55,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {761#false} assume 0 == ~cond; {761#false} is VALID [2022-04-14 15:30:55,329 INFO L290 TraceCheckUtils]: 26: Hoare triple {761#false} assume !false; {761#false} is VALID [2022-04-14 15:30:55,329 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-14 15:30:55,330 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 15:30:55,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:30:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [735905328] [2022-04-14 15:30:55,330 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:30:55,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048369031] [2022-04-14 15:30:55,330 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048369031] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 15:30:55,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 15:30:55,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 15:30:55,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [104179360] [2022-04-14 15:30:55,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 15:30:55,332 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-14 15:30:55,332 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:30:55,332 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:30:55,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:55,359 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 15:30:55,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:30:55,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 15:30:55,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:30:55,360 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:30:55,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:55,437 INFO L93 Difference]: Finished difference Result 51 states and 57 transitions. [2022-04-14 15:30:55,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 15:30:55,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-14 15:30:55,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:30:55,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:30:55,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-14 15:30:55,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:30:55,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 48 transitions. [2022-04-14 15:30:55,448 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 48 transitions. [2022-04-14 15:30:55,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:55,507 INFO L225 Difference]: With dead ends: 51 [2022-04-14 15:30:55,507 INFO L226 Difference]: Without dead ends: 33 [2022-04-14 15:30:55,508 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 15:30:55,511 INFO L913 BasicCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 45 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 15:30:55,511 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 45 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 15:30:55,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-04-14 15:30:55,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2022-04-14 15:30:55,525 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:30:55,526 INFO L82 GeneralOperation]: Start isEquivalent. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:55,526 INFO L74 IsIncluded]: Start isIncluded. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:55,528 INFO L87 Difference]: Start difference. First operand 33 states. Second operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:55,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:55,536 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-14 15:30:55,536 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-14 15:30:55,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:55,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:55,539 INFO L74 IsIncluded]: Start isIncluded. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-14 15:30:55,539 INFO L87 Difference]: Start difference. First operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 33 states. [2022-04-14 15:30:55,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:55,541 INFO L93 Difference]: Finished difference Result 33 states and 36 transitions. [2022-04-14 15:30:55,541 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-14 15:30:55,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:55,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:55,542 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:30:55,542 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:30:55,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 6 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:55,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 36 transitions. [2022-04-14 15:30:55,548 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 36 transitions. Word has length 27 [2022-04-14 15:30:55,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:30:55,548 INFO L478 AbstractCegarLoop]: Abstraction has 33 states and 36 transitions. [2022-04-14 15:30:55,548 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-14 15:30:55,549 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 36 transitions. [2022-04-14 15:30:55,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-14 15:30:55,550 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:30:55,550 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 15:30:55,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-14 15:30:55,771 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:30:55,772 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:30:55,772 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:30:55,772 INFO L85 PathProgramCache]: Analyzing trace with hash 608527918, now seen corresponding path program 1 times [2022-04-14 15:30:55,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:30:55,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [401714187] [2022-04-14 15:30:55,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:55,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:30:55,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:30:55,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [278744959] [2022-04-14 15:30:55,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:55,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:30:55,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:30:55,787 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:30:55,800 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-14 15:30:55,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:55,852 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-14 15:30:55,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 15:30:55,866 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 15:30:56,106 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-14 15:30:56,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#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(10, 2); {1024#true} is VALID [2022-04-14 15:30:56,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-14 15:30:56,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #84#return; {1024#true} is VALID [2022-04-14 15:30:56,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret2 := main(); {1024#true} is VALID [2022-04-14 15:30:56,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {1024#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1024#true} is VALID [2022-04-14 15:30:56,107 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1024#true} is VALID [2022-04-14 15:30:56,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-14 15:30:56,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-14 15:30:56,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-14 15:30:56,108 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #78#return; {1024#true} is VALID [2022-04-14 15:30:56,108 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1024#true} is VALID [2022-04-14 15:30:56,108 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} assume !false; {1024#true} is VALID [2022-04-14 15:30:56,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1024#true} is VALID [2022-04-14 15:30:56,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} assume !false; {1024#true} is VALID [2022-04-14 15:30:56,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1024#true} is VALID [2022-04-14 15:30:56,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume !false; {1024#true} is VALID [2022-04-14 15:30:56,109 INFO L272 TraceCheckUtils]: 17: Hoare triple {1024#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1024#true} is VALID [2022-04-14 15:30:56,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {1024#true} ~cond := #in~cond; {1083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-14 15:30:56,116 INFO L290 TraceCheckUtils]: 19: Hoare triple {1083#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:30:56,116 INFO L290 TraceCheckUtils]: 20: Hoare triple {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:30:56,117 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} {1024#true} #80#return; {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:30:56,118 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:30:56,119 INFO L272 TraceCheckUtils]: 23: Hoare triple {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1101#(= |__VERIFIER_assert_#in~cond| 1)} is VALID [2022-04-14 15:30:56,119 INFO L290 TraceCheckUtils]: 24: Hoare triple {1101#(= |__VERIFIER_assert_#in~cond| 1)} ~cond := #in~cond; {1105#(= __VERIFIER_assert_~cond 1)} is VALID [2022-04-14 15:30:56,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {1105#(= __VERIFIER_assert_~cond 1)} assume 0 == ~cond; {1025#false} is VALID [2022-04-14 15:30:56,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-14 15:30:56,120 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 15:30:56,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-14 15:30:57,100 INFO L290 TraceCheckUtils]: 26: Hoare triple {1025#false} assume !false; {1025#false} is VALID [2022-04-14 15:30:57,101 INFO L290 TraceCheckUtils]: 25: Hoare triple {1115#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {1025#false} is VALID [2022-04-14 15:30:57,101 INFO L290 TraceCheckUtils]: 24: Hoare triple {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {1115#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:30:57,102 INFO L272 TraceCheckUtils]: 23: Hoare triple {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:30:57,103 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} assume !(~b~0 % 4294967296 != ~B~0 % 4294967296); {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:30:57,104 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} {1024#true} #80#return; {1094#(= (mod main_~A~0 4294967296) (mod (+ main_~r~0 (* main_~b~0 main_~q~0)) 4294967296))} is VALID [2022-04-14 15:30:57,104 INFO L290 TraceCheckUtils]: 20: Hoare triple {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:30:57,104 INFO L290 TraceCheckUtils]: 19: Hoare triple {1137#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1087#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-14 15:30:57,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {1024#true} ~cond := #in~cond; {1137#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-14 15:30:57,105 INFO L272 TraceCheckUtils]: 17: Hoare triple {1024#true} call __VERIFIER_assert((if ~A~0 % 4294967296 == (~q~0 * ~b~0 + ~r~0) % 4294967296 then 1 else 0)); {1024#true} is VALID [2022-04-14 15:30:57,105 INFO L290 TraceCheckUtils]: 16: Hoare triple {1024#true} assume !false; {1024#true} is VALID [2022-04-14 15:30:57,105 INFO L290 TraceCheckUtils]: 15: Hoare triple {1024#true} assume !(~r~0 % 4294967296 >= ~b~0 % 4294967296); {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {1024#true} assume !false; {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L290 TraceCheckUtils]: 13: Hoare triple {1024#true} assume !!(~r~0 % 4294967296 >= ~b~0 % 4294967296);~b~0 := 2 * ~b~0; {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L290 TraceCheckUtils]: 12: Hoare triple {1024#true} assume !false; {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L290 TraceCheckUtils]: 11: Hoare triple {1024#true} ~B~0 := 1;~q~0 := 0;~r~0 := ~A~0;~b~0 := ~B~0; {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1024#true} {1024#true} #78#return; {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {1024#true} assume !(0 == ~cond); {1024#true} is VALID [2022-04-14 15:30:57,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {1024#true} ~cond := #in~cond; {1024#true} is VALID [2022-04-14 15:30:57,107 INFO L272 TraceCheckUtils]: 6: Hoare triple {1024#true} call assume_abort_if_not((if ~A~0 % 4294967296 >= 0 && ~A~0 % 4294967296 <= 1 then 1 else 0)); {1024#true} is VALID [2022-04-14 15:30:57,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {1024#true} havoc ~A~0;havoc ~B~0;havoc ~q~0;havoc ~r~0;havoc ~b~0;~A~0 := #t~nondet1;havoc #t~nondet1; {1024#true} is VALID [2022-04-14 15:30:57,107 INFO L272 TraceCheckUtils]: 4: Hoare triple {1024#true} call #t~ret2 := main(); {1024#true} is VALID [2022-04-14 15:30:57,107 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1024#true} {1024#true} #84#return; {1024#true} is VALID [2022-04-14 15:30:57,107 INFO L290 TraceCheckUtils]: 2: Hoare triple {1024#true} assume true; {1024#true} is VALID [2022-04-14 15:30:57,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {1024#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(10, 2); {1024#true} is VALID [2022-04-14 15:30:57,107 INFO L272 TraceCheckUtils]: 0: Hoare triple {1024#true} call ULTIMATE.init(); {1024#true} is VALID [2022-04-14 15:30:57,108 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-14 15:30:57,108 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 15:30:57,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [401714187] [2022-04-14 15:30:57,108 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 15:30:57,108 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [278744959] [2022-04-14 15:30:57,108 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [278744959] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-14 15:30:57,108 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-14 15:30:57,108 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-04-14 15:30:57,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906325638] [2022-04-14 15:30:57,109 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-04-14 15:30:57,109 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-14 15:30:57,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 15:30:57,110 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 15:30:57,133 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:57,133 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-14 15:30:57,133 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 15:30:57,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-14 15:30:57,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-04-14 15:30:57,134 INFO L87 Difference]: Start difference. First operand 33 states and 36 transitions. Second operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 15:30:59,279 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-14 15:30:59,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:59,519 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2022-04-14 15:30:59,519 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-14 15:30:59,519 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 27 [2022-04-14 15:30:59,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 15:30:59,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 15:30:59,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-14 15:30:59,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 15:30:59,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 35 transitions. [2022-04-14 15:30:59,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 35 transitions. [2022-04-14 15:30:59,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 15:30:59,557 INFO L225 Difference]: With dead ends: 39 [2022-04-14 15:30:59,557 INFO L226 Difference]: Without dead ends: 32 [2022-04-14 15:30:59,557 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-04-14 15:30:59,558 INFO L913 BasicCegarLoop]: 23 mSDtfsCounter, 12 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.2s IncrementalHoareTripleChecker+Time [2022-04-14 15:30:59,558 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 94 Invalid, 46 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 1 Unknown, 0 Unchecked, 2.2s Time] [2022-04-14 15:30:59,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-14 15:30:59,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-14 15:30:59,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 15:30:59,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:59,567 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:59,567 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:59,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:59,569 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-14 15:30:59,569 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-14 15:30:59,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:59,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:59,570 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-14 15:30:59,570 INFO L87 Difference]: Start difference. First operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Second operand 32 states. [2022-04-14 15:30:59,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 15:30:59,571 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2022-04-14 15:30:59,571 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-14 15:30:59,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 15:30:59,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 15:30:59,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 15:30:59,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 15:30:59,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.1363636363636365) internal successors, (25), 23 states have internal predecessors, (25), 5 states have call successors, (5), 5 states have call predecessors, (5), 4 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 15:30:59,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2022-04-14 15:30:59,573 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 27 [2022-04-14 15:30:59,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 15:30:59,574 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2022-04-14 15:30:59,574 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (6), 3 states have call predecessors, (6), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-14 15:30:59,574 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2022-04-14 15:30:59,574 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-14 15:30:59,574 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 15:30:59,575 INFO L499 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, 1, 1, 1] [2022-04-14 15:30:59,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-14 15:30:59,775 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:30:59,775 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 15:30:59,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 15:30:59,776 INFO L85 PathProgramCache]: Analyzing trace with hash 1574040585, now seen corresponding path program 1 times [2022-04-14 15:30:59,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 15:30:59,776 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641241722] [2022-04-14 15:30:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:59,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 15:30:59,789 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 15:30:59,789 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1028854663] [2022-04-14 15:30:59,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 15:30:59,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 15:30:59,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 15:30:59,790 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-14 15:30:59,829 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process