./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a3cc8f4dc3627ca478516e9ddf056bcaabf24874a2c66b0dbc53cccb617610ef --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 05:15:31,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 05:15:31,295 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-12 05:15:31,301 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 05:15:31,302 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 05:15:31,342 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 05:15:31,343 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 05:15:31,343 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 05:15:31,344 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 05:15:31,345 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 05:15:31,346 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 05:15:31,346 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 05:15:31,347 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 05:15:31,347 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 05:15:31,349 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 05:15:31,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 05:15:31,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 05:15:31,350 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 05:15:31,351 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 05:15:31,351 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 05:15:31,351 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 05:15:31,352 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 05:15:31,352 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 05:15:31,353 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 05:15:31,353 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 05:15:31,353 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 05:15:31,353 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 05:15:31,354 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 05:15:31,354 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 05:15:31,354 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 05:15:31,354 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 05:15:31,355 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 05:15:31,359 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:15:31,359 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 05:15:31,359 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 05:15:31,359 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 05:15:31,360 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 05:15:31,360 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 05:15:31,360 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 05:15:31,360 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 05:15:31,361 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 05:15:31,362 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 05:15:31,362 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a3cc8f4dc3627ca478516e9ddf056bcaabf24874a2c66b0dbc53cccb617610ef [2024-11-12 05:15:31,630 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 05:15:31,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 05:15:31,666 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 05:15:31,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 05:15:31,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 05:15:31,670 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-12 05:15:33,255 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 05:15:33,496 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 05:15:33,498 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-12 05:15:33,513 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1061b99/0b91738f713f4e7a80bf340f0c213778/FLAG8f8d3481a [2024-11-12 05:15:33,533 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/df1061b99/0b91738f713f4e7a80bf340f0c213778 [2024-11-12 05:15:33,536 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 05:15:33,538 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 05:15:33,542 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 05:15:33,542 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 05:15:33,548 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 05:15:33,549 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:33,550 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56d6d540 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33, skipping insertion in model container [2024-11-12 05:15:33,553 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:33,593 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 05:15:33,764 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i[916,929] [2024-11-12 05:15:33,860 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:15:33,878 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 05:15:33,889 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/hardness-nfm22/hardness_loopvsstraightlinecode_100-while_file-87.i[916,929] [2024-11-12 05:15:33,942 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 05:15:33,970 INFO L204 MainTranslator]: Completed translation [2024-11-12 05:15:33,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33 WrapperNode [2024-11-12 05:15:33,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 05:15:33,972 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 05:15:33,972 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 05:15:33,972 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 05:15:33,979 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:33,992 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,036 INFO L138 Inliner]: procedures = 26, calls = 47, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 216 [2024-11-12 05:15:34,038 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 05:15:34,039 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 05:15:34,039 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 05:15:34,040 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 05:15:34,053 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,053 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,058 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,085 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0]. [2024-11-12 05:15:34,086 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,086 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,115 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,121 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,129 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,136 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,181 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 05:15:34,183 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 05:15:34,183 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 05:15:34,183 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 05:15:34,184 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (1/1) ... [2024-11-12 05:15:34,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 05:15:34,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:15:34,270 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-12 05:15:34,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-12 05:15:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 05:15:34,333 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-12 05:15:34,335 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-12 05:15:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 05:15:34,335 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 05:15:34,335 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 05:15:34,443 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 05:15:34,446 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 05:15:34,987 INFO L? ?]: Removed 32 outVars from TransFormulas that were not future-live. [2024-11-12 05:15:34,988 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 05:15:35,007 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 05:15:35,009 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-12 05:15:35,010 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:15:35 BoogieIcfgContainer [2024-11-12 05:15:35,010 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 05:15:35,013 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 05:15:35,014 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 05:15:35,018 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 05:15:35,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:15:33" (1/3) ... [2024-11-12 05:15:35,019 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ceadef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:15:35, skipping insertion in model container [2024-11-12 05:15:35,020 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:15:33" (2/3) ... [2024-11-12 05:15:35,020 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@15ceadef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:15:35, skipping insertion in model container [2024-11-12 05:15:35,021 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:15:35" (3/3) ... [2024-11-12 05:15:35,022 INFO L112 eAbstractionObserver]: Analyzing ICFG hardness_loopvsstraightlinecode_100-while_file-87.i [2024-11-12 05:15:35,040 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 05:15:35,041 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-12 05:15:35,111 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 05:15:35,118 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@ed087f7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 05:15:35,118 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-12 05:15:35,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 05:15:35,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-12 05:15:35,148 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:15:35,149 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:15:35,150 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:15:35,157 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:15:35,158 INFO L85 PathProgramCache]: Analyzing trace with hash -938730253, now seen corresponding path program 1 times [2024-11-12 05:15:35,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:15:35,168 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1240563248] [2024-11-12 05:15:35,168 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:15:35,169 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:15:35,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:15:35,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,651 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:15:35,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,659 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 05:15:35,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,671 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:15:35,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,680 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:15:35,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,690 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 05:15:35,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,699 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:15:35,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,709 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 05:15:35,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,720 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:15:35,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:15:35,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,733 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:15:35,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,743 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 05:15:35,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,751 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:15:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,763 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 05:15:35,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,770 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:15:35,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,778 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 05:15:35,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,817 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:15:35,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,825 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 05:15:35,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,834 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:15:35,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,841 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:15:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,847 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:15:35,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,853 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:15:35,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:15:35,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,869 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:15:35,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,876 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:15:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,881 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 05:15:35,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,886 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:15:35,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,890 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 05:15:35,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,894 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:15:35,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,903 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 05:15:35,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:15:35,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,915 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 05:15:35,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,921 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 05:15:35,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,927 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-12 05:15:35,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:35,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 05:15:35,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:15:35,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1240563248] [2024-11-12 05:15:35,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1240563248] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 05:15:35,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 05:15:35,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 05:15:35,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754801990] [2024-11-12 05:15:35,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:15:35,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-12 05:15:35,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:15:35,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-12 05:15:35,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:15:35,982 INFO L87 Difference]: Start difference. First operand has 92 states, 55 states have (on average 1.3636363636363635) internal successors, (75), 56 states have internal predecessors, (75), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) Second operand has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-12 05:15:36,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:15:36,014 INFO L93 Difference]: Finished difference Result 177 states and 314 transitions. [2024-11-12 05:15:36,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-12 05:15:36,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) Word has length 213 [2024-11-12 05:15:36,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:15:36,026 INFO L225 Difference]: With dead ends: 177 [2024-11-12 05:15:36,027 INFO L226 Difference]: Without dead ends: 88 [2024-11-12 05:15:36,032 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-12 05:15:36,037 INFO L435 NwaCegarLoop]: 136 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-12 05:15:36,041 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-12 05:15:36,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-11-12 05:15:36,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-11-12 05:15:36,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 52 states have (on average 1.3076923076923077) internal successors, (68), 52 states have internal predecessors, (68), 34 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 05:15:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 136 transitions. [2024-11-12 05:15:36,096 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 136 transitions. Word has length 213 [2024-11-12 05:15:36,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:15:36,097 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 136 transitions. [2024-11-12 05:15:36,098 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 23.0) internal successors, (46), 2 states have internal predecessors, (46), 2 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 2 states have call successors, (34) [2024-11-12 05:15:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 136 transitions. [2024-11-12 05:15:36,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-12 05:15:36,104 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:15:36,104 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:15:36,105 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 05:15:36,105 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:15:36,106 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:15:36,106 INFO L85 PathProgramCache]: Analyzing trace with hash 848476715, now seen corresponding path program 1 times [2024-11-12 05:15:36,106 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:15:36,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826429511] [2024-11-12 05:15:36,107 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:15:36,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:15:36,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,225 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:15:37,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,230 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:15:37,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,235 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 05:15:37,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,242 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:15:37,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:15:37,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 05:15:37,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:15:37,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,266 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 05:15:37,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:15:37,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,273 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:15:37,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:15:37,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,284 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 05:15:37,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:15:37,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 05:15:37,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:15:37,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,301 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 05:15:37,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,342 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:15:37,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,352 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 05:15:37,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:15:37,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,377 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:15:37,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,392 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:15:37,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:15:37,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,406 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:15:37,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,416 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:15:37,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,425 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:15:37,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,436 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 05:15:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:15:37,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 05:15:37,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:15:37,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,469 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 05:15:37,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,477 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:15:37,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 05:15:37,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,493 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 05:15:37,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,501 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-12 05:15:37,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,516 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-12 05:15:37,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:15:37,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826429511] [2024-11-12 05:15:37,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826429511] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:15:37,520 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [502052973] [2024-11-12 05:15:37,520 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:15:37,521 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:15:37,521 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:15:37,525 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) [2024-11-12 05:15:37,528 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-12 05:15:37,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:37,775 INFO L256 TraceCheckSpWp]: Trace formula consists of 510 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-12 05:15:37,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:15:38,133 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1143 proven. 54 refuted. 0 times theorem prover too weak. 1047 trivial. 0 not checked. [2024-11-12 05:15:38,133 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:15:38,454 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 45 proven. 54 refuted. 0 times theorem prover too weak. 2145 trivial. 0 not checked. [2024-11-12 05:15:38,455 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [502052973] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:15:38,455 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:15:38,455 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2024-11-12 05:15:38,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772786340] [2024-11-12 05:15:38,456 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:15:38,458 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 05:15:38,458 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:15:38,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 05:15:38,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-12 05:15:38,460 INFO L87 Difference]: Start difference. First operand 88 states and 136 transitions. Second operand has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-12 05:15:38,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:15:38,777 INFO L93 Difference]: Finished difference Result 181 states and 276 transitions. [2024-11-12 05:15:38,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-12 05:15:38,778 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) Word has length 213 [2024-11-12 05:15:38,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:15:38,781 INFO L225 Difference]: With dead ends: 181 [2024-11-12 05:15:38,781 INFO L226 Difference]: Without dead ends: 96 [2024-11-12 05:15:38,782 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 500 GetRequests, 490 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2024-11-12 05:15:38,783 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 62 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-12 05:15:38,784 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 220 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-12 05:15:38,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-12 05:15:38,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 92. [2024-11-12 05:15:38,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.2727272727272727) internal successors, (70), 55 states have internal predecessors, (70), 34 states have call successors, (34), 2 states have call predecessors, (34), 2 states have return successors, (34), 34 states have call predecessors, (34), 34 states have call successors, (34) [2024-11-12 05:15:38,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 138 transitions. [2024-11-12 05:15:38,812 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 138 transitions. Word has length 213 [2024-11-12 05:15:38,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:15:38,813 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 138 transitions. [2024-11-12 05:15:38,814 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.857142857142857) internal successors, (55), 7 states have internal predecessors, (55), 2 states have call successors, (52), 2 states have call predecessors, (52), 4 states have return successors, (53), 2 states have call predecessors, (53), 2 states have call successors, (53) [2024-11-12 05:15:38,814 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 138 transitions. [2024-11-12 05:15:38,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-12 05:15:38,823 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:15:38,823 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:15:38,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-12 05:15:39,024 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:15:39,025 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:15:39,025 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:15:39,026 INFO L85 PathProgramCache]: Analyzing trace with hash -172591639, now seen corresponding path program 1 times [2024-11-12 05:15:39,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:15:39,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [55200727] [2024-11-12 05:15:39,026 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:15:39,026 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:15:39,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2024-11-12 05:15:40,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2024-11-12 05:15:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,354 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-11-12 05:15:40,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,357 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 21 [2024-11-12 05:15:40,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,361 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 26 [2024-11-12 05:15:40,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,364 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 05:15:40,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-12 05:15:40,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,370 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 42 [2024-11-12 05:15:40,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,373 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 05:15:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,376 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 53 [2024-11-12 05:15:40,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 59 [2024-11-12 05:15:40,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 64 [2024-11-12 05:15:40,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,400 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 70 [2024-11-12 05:15:40,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,402 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 75 [2024-11-12 05:15:40,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 81 [2024-11-12 05:15:40,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 86 [2024-11-12 05:15:40,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 05:15:40,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,434 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 97 [2024-11-12 05:15:40,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,437 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 103 [2024-11-12 05:15:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 109 [2024-11-12 05:15:40,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,444 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 05:15:40,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,447 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 120 [2024-11-12 05:15:40,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 126 [2024-11-12 05:15:40,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,453 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 131 [2024-11-12 05:15:40,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,456 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 137 [2024-11-12 05:15:40,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 142 [2024-11-12 05:15:40,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 148 [2024-11-12 05:15:40,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,465 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 153 [2024-11-12 05:15:40,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,468 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 159 [2024-11-12 05:15:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,472 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 164 [2024-11-12 05:15:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,475 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 170 [2024-11-12 05:15:40,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 175 [2024-11-12 05:15:40,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,482 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 181 [2024-11-12 05:15:40,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,492 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 186 [2024-11-12 05:15:40,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,498 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 60 refuted. 0 times theorem prover too weak. 2052 trivial. 0 not checked. [2024-11-12 05:15:40,498 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:15:40,498 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [55200727] [2024-11-12 05:15:40,499 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [55200727] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 05:15:40,499 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931020265] [2024-11-12 05:15:40,499 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:15:40,499 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:15:40,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:15:40,501 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) [2024-11-12 05:15:40,503 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-12 05:15:40,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:40,665 INFO L256 TraceCheckSpWp]: Trace formula consists of 509 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-12 05:15:40,672 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:15:40,979 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1229 proven. 60 refuted. 0 times theorem prover too weak. 955 trivial. 0 not checked. [2024-11-12 05:15:40,980 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:15:41,410 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 132 proven. 63 refuted. 0 times theorem prover too weak. 2049 trivial. 0 not checked. [2024-11-12 05:15:41,410 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931020265] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 05:15:41,411 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 05:15:41,411 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 10, 10] total 18 [2024-11-12 05:15:41,411 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128518662] [2024-11-12 05:15:41,411 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 05:15:41,412 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-12 05:15:41,412 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:15:41,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-12 05:15:41,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=76, Invalid=230, Unknown=0, NotChecked=0, Total=306 [2024-11-12 05:15:41,414 INFO L87 Difference]: Start difference. First operand 92 states and 138 transitions. Second operand has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-12 05:15:42,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 05:15:42,435 INFO L93 Difference]: Finished difference Result 304 states and 442 transitions. [2024-11-12 05:15:42,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-12 05:15:42,437 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) Word has length 213 [2024-11-12 05:15:42,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 05:15:42,442 INFO L225 Difference]: With dead ends: 304 [2024-11-12 05:15:42,444 INFO L226 Difference]: Without dead ends: 215 [2024-11-12 05:15:42,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 517 GetRequests, 485 SyntacticMatches, 1 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=282, Invalid=774, Unknown=0, NotChecked=0, Total=1056 [2024-11-12 05:15:42,447 INFO L435 NwaCegarLoop]: 117 mSDtfsCounter, 465 mSDsluCounter, 551 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 354 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 481 SdHoareTripleChecker+Valid, 668 SdHoareTripleChecker+Invalid, 1104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 354 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 05:15:42,447 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [481 Valid, 668 Invalid, 1104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [354 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 05:15:42,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215 states. [2024-11-12 05:15:42,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215 to 184. [2024-11-12 05:15:42,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 110 states have (on average 1.2272727272727273) internal successors, (135), 111 states have internal predecessors, (135), 66 states have call successors, (66), 7 states have call predecessors, (66), 7 states have return successors, (66), 65 states have call predecessors, (66), 66 states have call successors, (66) [2024-11-12 05:15:42,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2024-11-12 05:15:42,492 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 267 transitions. Word has length 213 [2024-11-12 05:15:42,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 05:15:42,493 INFO L471 AbstractCegarLoop]: Abstraction has 184 states and 267 transitions. [2024-11-12 05:15:42,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 4.0) internal successors, (72), 18 states have internal predecessors, (72), 4 states have call successors, (55), 3 states have call predecessors, (55), 7 states have return successors, (57), 4 states have call predecessors, (57), 4 states have call successors, (57) [2024-11-12 05:15:42,495 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 267 transitions. [2024-11-12 05:15:42,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 214 [2024-11-12 05:15:42,499 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 05:15:42,500 INFO L218 NwaCegarLoop]: trace histogram [34, 34, 34, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 05:15:42,519 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-12 05:15:42,704 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2024-11-12 05:15:42,705 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-12 05:15:42,706 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 05:15:42,706 INFO L85 PathProgramCache]: Analyzing trace with hash 2128230951, now seen corresponding path program 1 times [2024-11-12 05:15:42,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 05:15:42,706 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792338748] [2024-11-12 05:15:42,707 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:15:42,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 05:15:43,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-12 05:15:43,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [500484115] [2024-11-12 05:15:43,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 05:15:43,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 05:15:43,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 05:15:43,139 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) [2024-11-12 05:15:43,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-12 05:15:43,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 05:15:43,364 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-12 05:15:43,374 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 05:15:49,723 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 1654 proven. 363 refuted. 0 times theorem prover too weak. 227 trivial. 0 not checked. [2024-11-12 05:15:49,724 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 05:16:01,110 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse10 (mod c_~var_1_8~0 256))) (let ((.cse3 (+ c_~var_1_22~0 1 .cse10)) (.cse0 (mod c_~var_1_18~0 65536)) (.cse6 (= (mod c_~var_1_22~0 c_~var_1_6~0) 0)) (.cse2 (+ c_~var_1_22~0 .cse10)) (.cse7 (div c_~var_1_22~0 c_~var_1_6~0))) (and (or (< c_~var_1_22~0 0) (and (forall ((v_y_119 Int) (v_z_119 Int)) (or (< v_z_119 0) (< 0 (+ 2 v_y_119 .cse0)) (< 99 v_z_119))) (forall ((v_y_118 Int)) (< 0 (+ v_y_118 .cse0 1))))) (forall ((v_y_109 Int)) (let ((.cse1 (* v_y_109 100))) (or (< c_~var_1_6~0 (+ .cse1 1)) (< .cse2 (div c_~var_1_22~0 .cse1)) (< 0 (+ v_y_109 .cse0 1)) (not (= (mod c_~var_1_22~0 .cse1) 0))))) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< .cse2 (+ (div c_~var_1_22~0 (+ v_z_116 (* v_y_116 100))) 1)) (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< v_z_116 0))) (forall ((v_y_106 Int)) (let ((.cse4 (* v_y_106 100))) (or (< .cse3 (div c_~var_1_22~0 .cse4)) (= (mod c_~var_1_22~0 .cse4) 0) (< 0 (+ v_y_106 .cse0 1))))) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< .cse2 (+ (div c_~var_1_22~0 (* v_y_115 100)) 1)))) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse5 (+ (* v_y_107 100) v_z_107))) (or (< v_z_107 0) (< 99 v_z_107) (< .cse3 (div c_~var_1_22~0 .cse5)) (= (mod c_~var_1_22~0 .cse5) 0) (< 0 (+ 2 v_y_107 .cse0))))) (or .cse6 (< .cse3 .cse7) (< 0 (+ c_~var_1_6~0 1))) (forall ((v_z_110 Int) (v_y_110 Int)) (let ((.cse9 (* v_y_110 100))) (let ((.cse8 (+ v_z_110 .cse9))) (or (< 0 (+ 2 v_y_110 .cse0)) (< .cse2 (div c_~var_1_22~0 .cse8)) (< v_z_110 0) (< c_~var_1_6~0 (+ v_z_110 .cse9 1)) (< 99 v_z_110) (not (= (mod c_~var_1_22~0 .cse8) 0)))))) (or (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100)) (and (or (< .cse2 .cse7) (not .cse6)) (<= .cse2 .cse7)))))) is different from false [2024-11-12 05:16:01,388 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (mod c_~var_1_8~0 256))) (let ((.cse3 (+ c_~var_1_22~0 1 .cse8)) (.cse5 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse2 (mod c_~var_1_18~0 65536)) (.cse0 (+ c_~var_1_22~0 .cse8))) (and (forall ((v_y_109 Int)) (let ((.cse1 (* v_y_109 100))) (or (< .cse0 (div c_~var_1_22~0 .cse1)) (< 0 (+ v_y_109 .cse2 1)) (not (= (mod c_~var_1_22~0 .cse1) 0))))) (<= (+ c_~var_1_22~0 1) 0) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< .cse0 (+ (div c_~var_1_22~0 (+ v_z_116 (* v_y_116 100))) 1)) (< 0 (+ 2 v_y_116 .cse2)) (< 99 v_z_116) (< v_z_116 0))) (forall ((v_y_106 Int)) (let ((.cse4 (* v_y_106 100))) (or (< .cse3 (div c_~var_1_22~0 .cse4)) (= (mod c_~var_1_22~0 .cse4) 0) (< 0 (+ v_y_106 .cse2 1))))) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse2 1)) (< .cse0 (+ (div c_~var_1_22~0 (* v_y_115 100)) 1)))) (or (< 0 (+ c_~var_1_6~0 (* .cse2 100) 100)) (< .cse0 .cse5)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse6 (+ (* v_y_107 100) v_z_107))) (or (< v_z_107 0) (< 99 v_z_107) (< .cse3 (div c_~var_1_22~0 .cse6)) (= (mod c_~var_1_22~0 .cse6) 0) (< 0 (+ 2 v_y_107 .cse2))))) (or (= (mod c_~var_1_22~0 c_~var_1_6~0) 0) (< .cse3 .cse5) (< 0 (+ c_~var_1_6~0 1))) (forall ((v_z_110 Int) (v_y_110 Int)) (let ((.cse7 (+ v_z_110 (* v_y_110 100)))) (or (< 0 (+ 2 v_y_110 .cse2)) (< .cse0 (div c_~var_1_22~0 .cse7)) (< v_z_110 0) (< 99 v_z_110) (not (= (mod c_~var_1_22~0 .cse7) 0)))))))) is different from false [2024-11-12 05:16:26,235 INFO L134 CoverageAnalysis]: Checked inductivity of 2244 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2244 trivial. 0 not checked. [2024-11-12 05:16:26,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 05:16:26,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792338748] [2024-11-12 05:16:26,236 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-12 05:16:26,237 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [500484115] [2024-11-12 05:16:26,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [500484115] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-12 05:16:26,237 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 05:16:26,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [35] total 42 [2024-11-12 05:16:26,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267077113] [2024-11-12 05:16:26,238 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 05:16:26,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 05:16:26,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 05:16:26,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 05:16:26,240 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=293, Invalid=1269, Unknown=6, NotChecked=154, Total=1722 [2024-11-12 05:16:26,240 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 9 states have internal predecessors, (46), 1 states have call successors, (34), 1 states have call predecessors, (34), 1 states have return successors, (34), 1 states have call predecessors, (34), 1 states have call successors, (34) [2024-11-12 05:16:26,292 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse22 (div c_~var_1_22~0 c_~var_1_5~0)) (.cse7 (= (mod c_~var_1_22~0 c_~var_1_6~0) 0)) (.cse24 (= (mod c_~var_1_22~0 c_~var_1_5~0) 0)) (.cse35 (+ c_~var_1_5~0 1))) (let ((.cse19 (< c_~var_1_22~0 0)) (.cse23 (< 0 .cse35)) (.cse21 (not .cse24)) (.cse8 (< 0 (+ c_~var_1_6~0 1))) (.cse12 (< c_~var_1_5~0 c_~var_1_6~0)) (.cse10 (not .cse7)) (.cse15 (+ .cse22 1)) (.cse16 (< c_~var_1_6~0 .cse35)) (.cse1 (mod c_~var_1_8~0 256)) (.cse11 (+ c_~var_1_25~0 c_~var_1_22~0)) (.cse6 (div c_~var_1_22~0 c_~var_1_6~0))) (let ((.cse9 (< .cse11 .cse6)) (.cse0 (mod c_~var_1_18~0 65536)) (.cse3 (mod (+ 34932 c_~var_1_29~0 .cse1) 65536)) (.cse28 (< .cse11 .cse22)) (.cse4 (< 0 (+ c_~var_1_22~0 1))) (.cse5 (+ c_~var_1_25~0 c_~var_1_22~0 1)) (.cse26 (mod c_~var_1_28~0 4294967296)) (.cse13 (let ((.cse34 (+ c_~var_1_22~0 .cse1))) (let ((.cse31 (< .cse34 .cse22)) (.cse33 (+ c_~var_1_22~0 1 .cse1)) (.cse32 (< .cse34 .cse6))) (and (or (and (or .cse31 .cse16) (or .cse12 .cse32)) .cse19) (or .cse23 .cse24 (< .cse33 .cse22)) (or .cse31 .cse21 .cse16) (or .cse7 (< .cse33 .cse6) .cse8) (or .cse12 (and (or .cse32 .cse10) (<= .cse34 .cse6))) (or (< .cse34 .cse15) .cse16)))))) (and (forall ((v_y_110 Int)) (or (< 0 (+ 2 v_y_110 .cse0)) (forall ((v_z_110 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse2 (+ v_z_110 (* v_y_110 100)))) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse2)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse2) 0))))) (< v_z_110 0) (< 99 v_z_110))))) (or .cse4 (< .cse5 .cse6) .cse7 .cse8) (or (and (or .cse9 .cse10) (<= .cse11 .cse6)) .cse12) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< (+ v_~var_1_22~0_12 .cse1) (+ (div v_~var_1_22~0_12 (+ v_z_116 (* v_y_116 100))) 1)) (< v_z_116 0))))) (or .cse13 (< |c_ULTIMATE.start_step_~stepLocal_5~0#1| (+ .cse0 1))) (or (let ((.cse25 (mod c_~var_1_28~0 65536))) (let ((.cse14 (+ .cse25 c_~var_1_22~0))) (let ((.cse17 (< .cse14 .cse6)) (.cse20 (< .cse14 .cse22)) (.cse18 (+ .cse25 c_~var_1_22~0 1))) (and (or (< .cse14 .cse15) .cse16) (or .cse12 (and (<= .cse14 .cse6) (or .cse17 .cse10))) (or .cse7 (< .cse18 .cse6) .cse8) (or .cse19 (and (or .cse20 .cse16) (or .cse12 .cse17))) (or .cse21 .cse20 .cse16) (or (< .cse18 .cse22) .cse23 .cse24))))) (< .cse1 .cse26)) (or (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100)) (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12))))) (forall ((v_y_109 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse27 (* v_y_109 100))) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse27) 0)) (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse27))))) (< 0 (+ v_y_109 .cse0 1)))) (or .cse19 (and (or .cse12 .cse9) (or .cse28 .cse16))) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse29 (+ (* v_y_107 100) v_z_107))) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse29)) (< v_z_107 0) (< 99 v_z_107) (= 0 (mod v_~var_1_22~0_12 .cse29)) (< 0 (+ 2 v_y_107 .cse0))))))) (or (< .cse11 .cse15) .cse16) (forall ((v_~var_1_22~0_12 Int)) (or (forall ((v_y_106 Int)) (let ((.cse30 (* v_y_106 100))) (or (= (mod v_~var_1_22~0_12 .cse30) 0) (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse30)) (< 0 (+ v_y_106 .cse0 1))))) (< .cse3 (+ 65536 v_~var_1_22~0_12)))) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< (+ v_~var_1_22~0_12 .cse1) (+ 1 (div v_~var_1_22~0_12 (* v_y_115 100)))))))) (or (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (= (mod v_~var_1_22~0_12 c_~var_1_6~0) 0))) .cse8) (<= 32768 .cse3) (or .cse21 .cse28 .cse16) (or .cse4 .cse23 .cse24 (< .cse5 .cse22)) (or (< .cse26 (+ 1 .cse1)) .cse13))))) is different from false [2024-11-12 05:16:31,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.33s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-12 05:16:36,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.08s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-12 05:16:40,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-12 05:16:44,221 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.12s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [1] [2024-11-12 05:16:44,492 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (mod c_~var_1_8~0 256)) (.cse0 (mod c_~var_1_18~0 65536))) (let ((.cse8 (< 0 (+ c_~var_1_6~0 (* .cse0 100) 100))) (.cse6 (+ c_~var_1_22~0 1 .cse1)) (.cse9 (div c_~var_1_22~0 c_~var_1_6~0)) (.cse4 (+ c_~var_1_22~0 .cse1)) (.cse12 (< 0 (+ c_~var_1_6~0 1))) (.cse3 (mod (+ 34932 c_~var_1_29~0 .cse1) 65536))) (and (forall ((v_y_110 Int)) (or (< 0 (+ 2 v_y_110 .cse0)) (forall ((v_z_110 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse2 (+ v_z_110 (* v_y_110 100)))) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse2)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse2) 0))))) (< v_z_110 0) (< 99 v_z_110))))) (forall ((v_y_109 Int)) (let ((.cse5 (* v_y_109 100))) (or (< .cse4 (div c_~var_1_22~0 .cse5)) (< 0 (+ v_y_109 .cse0 1)) (not (= (mod c_~var_1_22~0 .cse5) 0))))) (<= (+ c_~var_1_22~0 1) 0) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< (+ v_~var_1_22~0_12 .cse1) (+ (div v_~var_1_22~0_12 (+ v_z_116 (* v_y_116 100))) 1)) (< v_z_116 0))))) (forall ((v_z_116 Int) (v_y_116 Int)) (or (< .cse4 (+ (div c_~var_1_22~0 (+ v_z_116 (* v_y_116 100))) 1)) (< 0 (+ 2 v_y_116 .cse0)) (< 99 v_z_116) (< v_z_116 0))) (forall ((v_y_106 Int)) (let ((.cse7 (* v_y_106 100))) (or (< .cse6 (div c_~var_1_22~0 .cse7)) (= (mod c_~var_1_22~0 .cse7) 0) (< 0 (+ v_y_106 .cse0 1))))) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< .cse4 (+ (div c_~var_1_22~0 (* v_y_115 100)) 1)))) (or .cse8 (< .cse4 .cse9)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse10 (+ (* v_y_107 100) v_z_107))) (or (< v_z_107 0) (< 99 v_z_107) (< .cse6 (div c_~var_1_22~0 .cse10)) (= (mod c_~var_1_22~0 .cse10) 0) (< 0 (+ 2 v_y_107 .cse0))))) (or .cse8 (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12))))) (forall ((v_y_109 Int)) (or (forall ((v_~var_1_22~0_12 Int)) (let ((.cse11 (* v_y_109 100))) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (not (= (mod v_~var_1_22~0_12 .cse11) 0)) (< (+ v_~var_1_22~0_12 .cse1) (div v_~var_1_22~0_12 .cse11))))) (< 0 (+ v_y_109 .cse0 1)))) (or (= (mod c_~var_1_22~0 c_~var_1_6~0) 0) (< .cse6 .cse9) .cse12) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_107 Int) (v_z_107 Int)) (let ((.cse13 (+ (* v_y_107 100) v_z_107))) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse13)) (< v_z_107 0) (< 99 v_z_107) (= 0 (mod v_~var_1_22~0_12 .cse13)) (< 0 (+ 2 v_y_107 .cse0))))))) (forall ((v_~var_1_22~0_12 Int)) (or (forall ((v_y_106 Int)) (let ((.cse14 (* v_y_106 100))) (or (= (mod v_~var_1_22~0_12 .cse14) 0) (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 .cse14)) (< 0 (+ v_y_106 .cse0 1))))) (< .cse3 (+ 65536 v_~var_1_22~0_12)))) (forall ((v_z_110 Int) (v_y_110 Int)) (let ((.cse15 (+ v_z_110 (* v_y_110 100)))) (or (< 0 (+ 2 v_y_110 .cse0)) (< .cse4 (div c_~var_1_22~0 .cse15)) (< v_z_110 0) (< 99 v_z_110) (not (= (mod c_~var_1_22~0 .cse15) 0))))) (forall ((v_~var_1_22~0_12 Int)) (or (< .cse3 (+ 65536 v_~var_1_22~0_12)) (forall ((v_y_115 Int)) (or (< 0 (+ v_y_115 .cse0 1)) (< (+ v_~var_1_22~0_12 .cse1) (+ 1 (div v_~var_1_22~0_12 (* v_y_115 100)))))))) (or (forall ((v_~var_1_22~0_12 Int)) (or (< (+ v_~var_1_22~0_12 1 .cse1) (div v_~var_1_22~0_12 c_~var_1_6~0)) (< .cse3 (+ 65536 v_~var_1_22~0_12)) (= (mod v_~var_1_22~0_12 c_~var_1_6~0) 0))) .cse12) (<= 32768 .cse3)))) is different from false [2024-11-12 05:16:59,113 WARN L286 SmtUtils]: Spent 6.51s on a formula simplification. DAG size of input: 103 DAG size of output: 101 (called from [L 388] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)