/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/geo1-u_unwindbound5.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-14 16:19:35,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-14 16:19:35,136 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-14 16:19:35,172 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-14 16:19:35,173 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-14 16:19:35,174 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-14 16:19:35,176 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-14 16:19:35,181 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-14 16:19:35,182 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-14 16:19:35,187 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-14 16:19:35,188 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-14 16:19:35,189 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-14 16:19:35,189 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-14 16:19:35,191 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-14 16:19:35,192 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-14 16:19:35,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-14 16:19:35,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-14 16:19:35,196 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-14 16:19:35,198 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-14 16:19:35,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-14 16:19:35,204 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-14 16:19:35,205 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-14 16:19:35,206 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-14 16:19:35,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-14 16:19:35,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-14 16:19:35,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-14 16:19:35,214 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-14 16:19:35,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-14 16:19:35,216 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-14 16:19:35,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-14 16:19:35,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-14 16:19:35,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-14 16:19:35,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-14 16:19:35,219 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-14 16:19:35,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-14 16:19:35,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-14 16:19:35,221 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-14 16:19:35,221 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-14 16:19:35,222 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-14 16:19:35,222 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-14 16:19:35,223 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-14 16:19:35,224 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-14 16:19:35,225 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 16:19:35,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-14 16:19:35,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-14 16:19:35,260 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-04-14 16:19:35,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-04-14 16:19:35,261 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-04-14 16:19:35,261 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-04-14 16:19:35,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-04-14 16:19:35,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-04-14 16:19:35,262 INFO L138 SettingsManager]: * Use SBE=true [2022-04-14 16:19:35,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-14 16:19:35,263 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-14 16:19:35,263 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-14 16:19:35,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-14 16:19:35,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-14 16:19:35,264 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-14 16:19:35,264 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-14 16:19:35,264 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-14 16:19:35,264 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-14 16:19:35,265 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-14 16:19:35,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-14 16:19:35,265 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-14 16:19:35,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-14 16:19:35,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-14 16:19:35,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-14 16:19:35,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:19:35,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-14 16:19:35,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-04-14 16:19:35,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-04-14 16:19:35,267 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-04-14 16:19:35,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-04-14 16:19:35,268 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-04-14 16:19:35,268 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-04-14 16:19:35,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-14 16:19:35,268 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 16:19:35,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-14 16:19:35,531 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-14 16:19:35,533 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-14 16:19:35,534 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-14 16:19:35,535 INFO L275 PluginConnector]: CDTParser initialized [2022-04-14 16:19:35,536 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound5.c [2022-04-14 16:19:35,588 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa024f28/b1defc37c1b24bbb833153118a813eae/FLAG7448bbb1e [2022-04-14 16:19:35,963 INFO L306 CDTParser]: Found 1 translation units. [2022-04-14 16:19:35,963 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/geo1-u_unwindbound5.c [2022-04-14 16:19:35,968 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa024f28/b1defc37c1b24bbb833153118a813eae/FLAG7448bbb1e [2022-04-14 16:19:35,977 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/9aa024f28/b1defc37c1b24bbb833153118a813eae [2022-04-14 16:19:35,979 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-14 16:19:35,980 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-14 16:19:35,982 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-14 16:19:35,982 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-14 16:19:35,985 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-14 16:19:35,985 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:19:35" (1/1) ... [2022-04-14 16:19:35,986 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a900b55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:35, skipping insertion in model container [2022-04-14 16:19:35,986 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.04 04:19:35" (1/1) ... [2022-04-14 16:19:35,992 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-14 16:19:36,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-14 16:19:36,168 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/geo1-u_unwindbound5.c[555,568] [2022-04-14 16:19:36,201 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:19:36,208 INFO L203 MainTranslator]: Completed pre-run [2022-04-14 16:19:36,219 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/geo1-u_unwindbound5.c[555,568] [2022-04-14 16:19:36,224 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-14 16:19:36,234 INFO L208 MainTranslator]: Completed translation [2022-04-14 16:19:36,234 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36 WrapperNode [2022-04-14 16:19:36,234 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-14 16:19:36,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-14 16:19:36,235 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-14 16:19:36,235 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-14 16:19:36,244 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,244 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,249 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,249 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,261 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,266 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-14 16:19:36,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-14 16:19:36,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-14 16:19:36,275 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-14 16:19:36,276 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (1/1) ... [2022-04-14 16:19:36,283 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-14 16:19:36,291 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:19:36,305 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 16:19:36,331 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 16:19:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-14 16:19:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-14 16:19:36,352 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-14 16:19:36,353 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-14 16:19:36,355 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-14 16:19:36,355 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-14 16:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-14 16:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-14 16:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-14 16:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-14 16:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_uint [2022-04-14 16:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-14 16:19:36,355 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-14 16:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-14 16:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-14 16:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-14 16:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-14 16:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-14 16:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-14 16:19:36,356 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-14 16:19:36,408 INFO L234 CfgBuilder]: Building ICFG [2022-04-14 16:19:36,410 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-14 16:19:36,540 INFO L275 CfgBuilder]: Performing block encoding [2022-04-14 16:19:36,546 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-14 16:19:36,546 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-14 16:19:36,553 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:19:36 BoogieIcfgContainer [2022-04-14 16:19:36,553 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-14 16:19:36,564 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-14 16:19:36,565 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-14 16:19:36,567 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-14 16:19:36,567 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.04 04:19:35" (1/3) ... [2022-04-14 16:19:36,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5724d511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:19:36, skipping insertion in model container [2022-04-14 16:19:36,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.04 04:19:36" (2/3) ... [2022-04-14 16:19:36,568 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5724d511 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.04 04:19:36, skipping insertion in model container [2022-04-14 16:19:36,568 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.04 04:19:36" (3/3) ... [2022-04-14 16:19:36,569 INFO L111 eAbstractionObserver]: Analyzing ICFG geo1-u_unwindbound5.c [2022-04-14 16:19:36,573 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-04-14 16:19:36,573 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-14 16:19:36,642 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-14 16:19:36,646 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 16:19:36,646 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-14 16:19:36,661 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-14 16:19:36,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 16:19:36,665 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:19:36,665 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:19:36,666 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:19:36,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:19:36,670 INFO L85 PathProgramCache]: Analyzing trace with hash -1864317590, now seen corresponding path program 1 times [2022-04-14 16:19:36,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:19:36,678 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435394354] [2022-04-14 16:19:36,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:19:36,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:19:36,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:19:36,865 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-14 16:19:36,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:19:36,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-14 16:19:36,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-14 16:19:36,887 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-14 16:19:36,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {26#true} call ULTIMATE.init(); {31#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-14 16:19:36,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#(and (= ~counter~0 |old(~counter~0)|) (= |#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(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26#true} is VALID [2022-04-14 16:19:36,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume true; {26#true} is VALID [2022-04-14 16:19:36,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26#true} {26#true} #55#return; {26#true} is VALID [2022-04-14 16:19:36,891 INFO L272 TraceCheckUtils]: 4: Hoare triple {26#true} call #t~ret7 := main(); {26#true} is VALID [2022-04-14 16:19:36,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {26#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {26#true} is VALID [2022-04-14 16:19:36,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {26#true} assume !true; {27#false} is VALID [2022-04-14 16:19:36,892 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {27#false} is VALID [2022-04-14 16:19:36,892 INFO L272 TraceCheckUtils]: 8: Hoare triple {27#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {27#false} is VALID [2022-04-14 16:19:36,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} ~cond := #in~cond; {27#false} is VALID [2022-04-14 16:19:36,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == ~cond; {27#false} is VALID [2022-04-14 16:19:36,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-04-14 16:19:36,893 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 16:19:36,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:19:36,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435394354] [2022-04-14 16:19:36,895 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435394354] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:19:36,895 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:19:36,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-14 16:19:36,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65567874] [2022-04-14 16:19:36,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:19:36,903 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 16:19:36,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:19:36,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:36,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:19:36,928 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-14 16:19:36,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:19:36,948 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-14 16:19:36,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-14 16:19:36,952 INFO L87 Difference]: Start difference. First operand has 23 states, 14 states have (on average 1.3571428571428572) internal successors, (19), 15 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:37,068 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-14 16:19:37,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-14 16:19:37,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 16:19:37,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:19:37,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-14 16:19:37,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 52 transitions. [2022-04-14 16:19:37,084 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 52 transitions. [2022-04-14 16:19:37,176 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:19:37,183 INFO L225 Difference]: With dead ends: 41 [2022-04-14 16:19:37,183 INFO L226 Difference]: Without dead ends: 19 [2022-04-14 16:19:37,186 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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 16:19:37,189 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:19:37,189 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 28 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:19:37,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-04-14 16:19:37,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 18. [2022-04-14 16:19:37,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:19:37,214 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 16:19:37,214 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 16:19:37,215 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 16:19:37,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:37,217 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 16:19:37,217 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 16:19:37,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:19:37,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:19:37,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 16:19:37,219 INFO L87 Difference]: Start difference. First operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 19 states. [2022-04-14 16:19:37,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:37,221 INFO L93 Difference]: Finished difference Result 19 states and 21 transitions. [2022-04-14 16:19:37,221 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2022-04-14 16:19:37,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:19:37,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:19:37,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:19:37,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:19:37,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-14 16:19:37,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 20 transitions. [2022-04-14 16:19:37,225 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 20 transitions. Word has length 12 [2022-04-14 16:19:37,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:19:37,225 INFO L478 AbstractCegarLoop]: Abstraction has 18 states and 20 transitions. [2022-04-14 16:19:37,225 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,226 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 20 transitions. [2022-04-14 16:19:37,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-14 16:19:37,226 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:19:37,226 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:19:37,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-14 16:19:37,227 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:19:37,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:19:37,228 INFO L85 PathProgramCache]: Analyzing trace with hash 2049175951, now seen corresponding path program 1 times [2022-04-14 16:19:37,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:19:37,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219092523] [2022-04-14 16:19:37,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:19:37,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:19:37,243 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:19:37,243 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [159591334] [2022-04-14 16:19:37,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:19:37,243 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:19:37,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:19:37,247 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 16:19:37,254 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 16:19:37,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:19:37,326 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-14 16:19:37,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:19:37,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:19:37,498 INFO L272 TraceCheckUtils]: 0: Hoare triple {152#true} call ULTIMATE.init(); {152#true} is VALID [2022-04-14 16:19:37,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {152#true} is VALID [2022-04-14 16:19:37,499 INFO L290 TraceCheckUtils]: 2: Hoare triple {152#true} assume true; {152#true} is VALID [2022-04-14 16:19:37,499 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152#true} {152#true} #55#return; {152#true} is VALID [2022-04-14 16:19:37,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {152#true} call #t~ret7 := main(); {152#true} is VALID [2022-04-14 16:19:37,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {152#true} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-14 16:19:37,502 INFO L290 TraceCheckUtils]: 6: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-14 16:19:37,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} assume !!(#t~post6 < 5);havoc #t~post6; {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} is VALID [2022-04-14 16:19:37,511 INFO L272 TraceCheckUtils]: 8: Hoare triple {172#(and (= (mod main_~z~0 4294967296) main_~y~0) (= main_~x~0 1))} call __VERIFIER_assert((if 0 == 1 + (~x~0 * (~z~0 % 4294967296) - ~x~0 - ~y~0) then 1 else 0)); {182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-14 16:19:37,512 INFO L290 TraceCheckUtils]: 9: Hoare triple {182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-14 16:19:37,512 INFO L290 TraceCheckUtils]: 10: Hoare triple {186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {153#false} is VALID [2022-04-14 16:19:37,513 INFO L290 TraceCheckUtils]: 11: Hoare triple {153#false} assume !false; {153#false} is VALID [2022-04-14 16:19:37,514 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 16:19:37,514 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:19:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:19:37,517 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219092523] [2022-04-14 16:19:37,518 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:19:37,518 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [159591334] [2022-04-14 16:19:37,521 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [159591334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:19:37,521 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:19:37,521 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-14 16:19:37,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830478099] [2022-04-14 16:19:37,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:19:37,523 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 16:19:37,523 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:19:37,523 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:19:37,541 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-14 16:19:37,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:19:37,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-14 16:19:37,542 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-14 16:19:37,543 INFO L87 Difference]: Start difference. First operand 18 states and 20 transitions. Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:37,641 INFO L93 Difference]: Finished difference Result 29 states and 33 transitions. [2022-04-14 16:19:37,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-14 16:19:37,641 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-14 16:19:37,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:19:37,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-14 16:19:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 33 transitions. [2022-04-14 16:19:37,645 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 33 transitions. [2022-04-14 16:19:37,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:19:37,697 INFO L225 Difference]: With dead ends: 29 [2022-04-14 16:19:37,697 INFO L226 Difference]: Without dead ends: 27 [2022-04-14 16:19:37,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-14 16:19:37,700 INFO L913 BasicCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:19:37,701 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 58 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:19:37,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-14 16:19:37,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2022-04-14 16:19:37,710 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:19:37,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:37,713 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:37,713 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:37,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:37,716 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:19:37,716 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:19:37,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:19:37,717 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:19:37,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-14 16:19:37,717 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 27 states. [2022-04-14 16:19:37,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:37,719 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-14 16:19:37,720 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-14 16:19:37,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:19:37,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:19:37,720 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:19:37,721 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:19:37,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.25) internal successors, (20), 18 states have internal predecessors, (20), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:37,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2022-04-14 16:19:37,726 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 12 [2022-04-14 16:19:37,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:19:37,726 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2022-04-14 16:19:37,727 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:37,727 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2022-04-14 16:19:37,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-04-14 16:19:37,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:19:37,728 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:19:37,756 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 16:19:37,943 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 16:19:37,943 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:19:37,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:19:37,944 INFO L85 PathProgramCache]: Analyzing trace with hash -975399299, now seen corresponding path program 1 times [2022-04-14 16:19:37,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:19:37,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372325098] [2022-04-14 16:19:37,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:19:37,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:19:37,956 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:19:37,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477654923] [2022-04-14 16:19:37,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:19:37,957 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:19:37,957 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:19:37,958 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 16:19:37,963 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 16:19:37,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:19:37,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-14 16:19:38,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-14 16:19:38,005 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-14 16:19:38,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {324#true} call ULTIMATE.init(); {324#true} is VALID [2022-04-14 16:19:38,117 INFO L290 TraceCheckUtils]: 1: Hoare triple {324#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(9, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {332#(<= ~counter~0 0)} is VALID [2022-04-14 16:19:38,117 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#(<= ~counter~0 0)} assume true; {332#(<= ~counter~0 0)} is VALID [2022-04-14 16:19:38,118 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {332#(<= ~counter~0 0)} {324#true} #55#return; {332#(<= ~counter~0 0)} is VALID [2022-04-14 16:19:38,119 INFO L272 TraceCheckUtils]: 4: Hoare triple {332#(<= ~counter~0 0)} call #t~ret7 := main(); {332#(<= ~counter~0 0)} is VALID [2022-04-14 16:19:38,120 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#(<= ~counter~0 0)} havoc ~z~0;havoc ~k~0;havoc ~x~0;havoc ~y~0;havoc ~c~0;~z~0 := #t~nondet4;havoc #t~nondet4;~k~0 := #t~nondet5;havoc #t~nondet5;~x~0 := 1;~y~0 := ~z~0 % 4294967296;~c~0 := 1; {332#(<= ~counter~0 0)} is VALID [2022-04-14 16:19:38,120 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {348#(<= |main_#t~post6| 0)} is VALID [2022-04-14 16:19:38,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {348#(<= |main_#t~post6| 0)} assume !(#t~post6 < 5);havoc #t~post6; {325#false} is VALID [2022-04-14 16:19:38,125 INFO L290 TraceCheckUtils]: 8: Hoare triple {325#false} ~x~0 := ~x~0 * ((~z~0 - 1) % 4294967296); {325#false} is VALID [2022-04-14 16:19:38,125 INFO L272 TraceCheckUtils]: 9: Hoare triple {325#false} call __VERIFIER_assert((if 0 == 1 + ~x~0 - ~y~0 then 1 else 0)); {325#false} is VALID [2022-04-14 16:19:38,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {325#false} ~cond := #in~cond; {325#false} is VALID [2022-04-14 16:19:38,132 INFO L290 TraceCheckUtils]: 11: Hoare triple {325#false} assume 0 == ~cond; {325#false} is VALID [2022-04-14 16:19:38,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {325#false} assume !false; {325#false} is VALID [2022-04-14 16:19:38,132 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 16:19:38,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-14 16:19:38,133 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-14 16:19:38,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372325098] [2022-04-14 16:19:38,134 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-14 16:19:38,134 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477654923] [2022-04-14 16:19:38,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477654923] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-14 16:19:38,135 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-14 16:19:38,135 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-14 16:19:38,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940376233] [2022-04-14 16:19:38,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-14 16:19:38,136 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 16:19:38,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-14 16:19:38,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:38,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:19:38,149 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-14 16:19:38,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-04-14 16:19:38,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-14 16:19:38,150 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:19:38,151 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:38,200 INFO L93 Difference]: Finished difference Result 33 states and 35 transitions. [2022-04-14 16:19:38,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-14 16:19:38,201 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2022-04-14 16:19:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-14 16:19:38,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:38,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-14 16:19:38,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:38,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 30 transitions. [2022-04-14 16:19:38,207 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 30 transitions. [2022-04-14 16:19:38,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-14 16:19:38,232 INFO L225 Difference]: With dead ends: 33 [2022-04-14 16:19:38,232 INFO L226 Difference]: Without dead ends: 25 [2022-04-14 16:19:38,233 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-14 16:19:38,236 INFO L913 BasicCegarLoop]: 18 mSDtfsCounter, 0 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-14 16:19:38,237 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 48 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-14 16:19:38,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-14 16:19:38,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-14 16:19:38,249 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-14 16:19:38,249 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:38,250 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:38,256 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:38,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:38,258 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 16:19:38,258 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 16:19:38,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:19:38,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:19:38,259 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 16:19:38,259 INFO L87 Difference]: Start difference. First operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Second operand 25 states. [2022-04-14 16:19:38,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-14 16:19:38,261 INFO L93 Difference]: Finished difference Result 25 states and 27 transitions. [2022-04-14 16:19:38,261 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 16:19:38,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-14 16:19:38,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-14 16:19:38,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-14 16:19:38,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-14 16:19:38,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.1875) internal successors, (19), 18 states have internal predecessors, (19), 5 states have call successors, (5), 4 states have call predecessors, (5), 3 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-14 16:19:38,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2022-04-14 16:19:38,263 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2022-04-14 16:19:38,263 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-14 16:19:38,264 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2022-04-14 16:19:38,264 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-14 16:19:38,264 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2022-04-14 16:19:38,264 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-04-14 16:19:38,265 INFO L491 BasicCegarLoop]: Found error trace [2022-04-14 16:19:38,265 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-14 16:19:38,290 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-14 16:19:38,487 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 16:19:38,487 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-14 16:19:38,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-14 16:19:38,488 INFO L85 PathProgramCache]: Analyzing trace with hash 198190047, now seen corresponding path program 1 times [2022-04-14 16:19:38,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-14 16:19:38,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008102362] [2022-04-14 16:19:38,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:19:38,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-14 16:19:38,501 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-14 16:19:38,501 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [986078054] [2022-04-14 16:19:38,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-14 16:19:38,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-14 16:19:38,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-14 16:19:38,503 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 16:19:38,514 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 16:19:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 16:19:38,547 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-14 16:19:38,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-14 16:19:38,569 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-14 16:19:38,570 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-14 16:19:38,571 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-14 16:19:38,617 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-04-14 16:19:38,796 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 16:19:38,799 INFO L719 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1] [2022-04-14 16:19:38,801 INFO L177 ceAbstractionStarter]: Computing trace abstraction results [2022-04-14 16:19:38,822 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-14 16:19:38,822 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-14 16:19:38,823 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L33-3 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L16 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L13-2 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L33-4 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L33-1 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L17 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L16-2 has no Hoare annotation [2022-04-14 16:19:38,824 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: L47 has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: L34 has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: L47-1 has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-14 16:19:38,825 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-14 16:19:38,825 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-14 16:19:38,826 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.04 04:19:38 BoogieIcfgContainer [2022-04-14 16:19:38,826 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-14 16:19:38,828 INFO L158 Benchmark]: Toolchain (without parser) took 2846.50ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 142.4MB in the beginning and 175.5MB in the end (delta: -33.1MB). Peak memory consumption was 7.5MB. Max. memory is 8.0GB. [2022-04-14 16:19:38,828 INFO L158 Benchmark]: CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-14 16:19:38,829 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.06ms. Allocated memory is still 195.0MB. Free memory was 142.2MB in the beginning and 169.2MB in the end (delta: -27.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. [2022-04-14 16:19:38,829 INFO L158 Benchmark]: Boogie Preprocessor took 37.94ms. Allocated memory is still 195.0MB. Free memory was 169.2MB in the beginning and 167.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-14 16:19:38,829 INFO L158 Benchmark]: RCFGBuilder took 278.70ms. Allocated memory is still 195.0MB. Free memory was 167.6MB in the beginning and 157.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-14 16:19:38,830 INFO L158 Benchmark]: TraceAbstraction took 2261.59ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 156.6MB in the beginning and 175.5MB in the end (delta: -19.0MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. [2022-04-14 16:19:38,831 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.11ms. Allocated memory is still 195.0MB. Free memory is still 158.3MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 253.06ms. Allocated memory is still 195.0MB. Free memory was 142.2MB in the beginning and 169.2MB in the end (delta: -27.0MB). Peak memory consumption was 13.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 37.94ms. Allocated memory is still 195.0MB. Free memory was 169.2MB in the beginning and 167.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 278.70ms. Allocated memory is still 195.0MB. Free memory was 167.6MB in the beginning and 157.1MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * TraceAbstraction took 2261.59ms. Allocated memory was 195.0MB in the beginning and 234.9MB in the end (delta: 39.8MB). Free memory was 156.6MB in the beginning and 175.5MB in the end (delta: -19.0MB). Peak memory consumption was 21.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 18]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L22] int counter = 0; VAL [\old(counter)=4, counter=0] [L24] unsigned int z, k; [L25] long long x, y, c; [L26] z = __VERIFIER_nondet_uint() [L27] k = __VERIFIER_nondet_uint() [L29] x = 1 [L30] y = z [L31] c = 1 VAL [\old(counter)=0, c=1, counter=0, k=0, x=1, y=0, z=0] [L33] EXPR counter++ VAL [\old(counter)=0, c=1, counter=1, counter++=0, k=0, x=1, y=0, z=0] [L33] COND TRUE counter++<5 [L34] CALL __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(cond)=1, \old(counter)=0, counter=1] [L16] COND FALSE !(!(cond)) VAL [\old(cond)=1, \old(counter)=0, cond=1, counter=1] [L34] RET __VERIFIER_assert(x*z - x - y + 1 == 0) VAL [\old(counter)=0, c=1, counter=1, k=0, x=1, y=0, z=0] [L36] COND TRUE !(c < k) VAL [\old(counter)=0, c=1, counter=1, k=0, x=1, y=0, z=0] [L45] x = x * (z - 1) VAL [\old(counter)=0, c=1, counter=1, k=0, x=4294967295, y=0, z=0] [L47] CALL __VERIFIER_assert(1 + x - y == 0) VAL [\old(cond)=0, \old(counter)=0, counter=1] [L16] COND TRUE !(cond) VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] [L18] reach_error() VAL [\old(cond)=0, \old(counter)=0, cond=0, counter=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 30 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 2.2s, OverallIterations: 4, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 0.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 14 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 13 mSDsluCounter, 134 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 76 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 43 IncrementalHoareTripleChecker+Invalid, 46 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 58 mSDtfsCounter, 43 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 28 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=2, InterpolantAutomatonStates: 12, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 3 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 56 NumberOfCodeBlocks, 56 NumberOfCodeBlocksAsserted, 4 NumberOfCheckSat, 34 ConstructedInterpolants, 0 QuantifiedInterpolants, 83 SizeOfPredicates, 2 NumberOfNonLiveVariables, 144 ConjunctsInSsa, 12 ConjunctsInUnsatCore, 3 InterpolantComputations, 3 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-14 16:19:38,864 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...